{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:39:53Z","timestamp":1725745193466},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399916"},{"type":"electronic","value":"9783642399923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39992-3_7","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T10:08:18Z","timestamp":1376474898000},"page":"34-48","source":"Crossref","is-referenced-by-count":1,"title":["Linear Time Proof Verification on N-Graphs: A Graph Theoretic Approach"],"prefix":"10.1007","author":[{"given":"La\u00eds","family":"Andrade","sequence":"first","affiliation":[]},{"given":"Ruan","family":"Carvalho","sequence":"additional","affiliation":[]},{"given":"Anjolina","family":"de Oliveira","sequence":"additional","affiliation":[]},{"given":"Ruy","family":"de Queiroz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Alves, G.V., de Oliveira, A.G., de Queiroz, R.J.G.B.: Towards normalization for proof-graphs. In: Logic Colloquium, Bulletin of Symbolic Logic, Torino, United States of America, vol.\u00a011, pp. 302\u2013303 (2005)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-02261-6_8","volume-title":"Logic, Language, Information and Computation","author":"G.V. Alves","year":"2009","unstructured":"Alves, G.V., de Oliveira, A.G., de Queiroz, R.J.G.B.: Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol.\u00a05514, pp. 84\u201398. Springer, Heidelberg (2009)"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.3233\/FI-2011-380","volume":"106","author":"G.V. Alves","year":"2011","unstructured":"Alves, G.V., de Oliveira, A.G., de Queiroz, R.J.G.B.: Proof-graphs: a thorough cycle treatment, normalization and subformula property. Fundamenta Informaticae\u00a0106, 119\u2013147 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"7_CR5","unstructured":"Cruz, M.Q., de Oliveira, A.G., de Queiroz, R.J.G.B., de Paiva, V.: Intuitionistic N-graphs. Logic Journal of the IGPL (Print) (accepted for publication, 2013)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The Structure of Multiplicatives. Archive for Mathematical Logic\u00a028, 181\u2013203 (1989)","journal-title":"Archive for Mathematical Logic"},{"issue":"20","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1016\/j.tcs.2010.12.021","volume":"412","author":"S. Guerrini","year":"2011","unstructured":"Guerrini, S.: A Linear Algorithm for MLL Proof Net Correctness and Sequentialization. Theoretical Computer Science\u00a0412(20), 1958\u20131978 (2011)","journal-title":"Theoretical Computer Science"},{"key":"7_CR8","unstructured":"Harary, F.: Graph Theory. Addison-Wesley Publishing Company (1972)"},{"key":"7_CR9","unstructured":"Kneale, W.: The Province of Logic. Contemporary British Philosophy (1958)"},{"key":"7_CR10","unstructured":"Murawski, A.S., Ong, C.-H.L.: Dominator Trees and Fast Verification of Proof Nets. In: LICS 2000: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pp. 181\u2013191. IEEE Computer Society (2000)"},{"key":"7_CR11","unstructured":"de Oliveira, A.G.: Proofs from a Geometric Perspective. PhD Thesis, Universidade Federal de Pernambuco (2001)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"de Oliveira, A.G., de Queiroz, R.J.G.B.: Geometry of Deduction via Graphs of Proof. In: de Queiroz, R. (ed.) Logic for Concurrency and Synchronisation, pp. 3\u201388. Kluwer (2003)","DOI":"10.1007\/0-306-48088-3_1"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1093\/logcom\/13.5.777","volume":"13","author":"E. Robinson","year":"2003","unstructured":"Robinson, E.: Proof Nets for Classical Logic. Journal of Logic and Computation\u00a013, 777\u2013797 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Shoesmith, D.J., Smiley, T.J.: Multiple-Conclusion Logic. Cambridge University Press, London (1978)","DOI":"10.1017\/CBO9780511565687"},{"key":"7_CR15","unstructured":"Statman, R.: Structural Complexity of Proofs. PhD thesis, Stanford (1974)"},{"key":"7_CR16","unstructured":"Ungar, A.M.: Normalization, Cut-elimination and the Theory of Proofs. CSLI Lecture Notes, vol. 28. Center for the Study of Language and Information (1992)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39992-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T23:16:07Z","timestamp":1596323767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39992-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399916","9783642399923"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39992-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}