{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:55:50Z","timestamp":1728176150928},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319942049"},{"type":"electronic","value":"9783319942056"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94205-6_32","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T16:22:50Z","timestamp":1530289370000},"page":"481-497","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["From Syntactic Proofs to Combinatorial Proofs"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Acclavio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,30]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Bellin, G., van de Wiele, J.: Subnets of proof-nets in MLL$$^-$$. In: Advances in Linear Logic, pp. 249\u2013270. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150.013"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-45653-8_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K Br\u00fcnnler","year":"2001","unstructured":"Br\u00fcnnler, K., Tiu, A.F.: A local system for classical logic. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 347\u2013361. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45653-8_24"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"SA Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symb. Logic 44(1), 36\u201350 (1979)","journal-title":"J. Symb. Logic"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-11(1:4)2015","volume":"11","author":"A Das","year":"2015","unstructured":"Das, A.: On the relative proof complexity of deep inference via atomic flows. Log. Methods Comput. Sci. 11(1), 1\u201323 (2015)","journal-title":"Log. Methods Comput. Sci."},{"issue":"4","key":"32_CR5","first-page":"1","volume":"12","author":"A Das","year":"2016","unstructured":"Das, A., Stra\u00dfburger, L.: On linear rewriting systems for Boolean logic and some applications to proof theory. Log. Methods Comput. Sci. 12(4), 1\u201327 (2016)","journal-title":"Log. Methods Comput. Sci."},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R Duffin","year":"1965","unstructured":"Duffin, R.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"32_CR7","volume-title":"First-Order Logic and Automated Theorem Proving","author":"M Fitting","year":"2012","unstructured":"Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer Science & Business Media, Heidelberg (2012)"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. I. Mathematische Zeitschrift 39, 176\u2013210 (1935)","journal-title":"I. Mathematische Zeitschrift"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44802-0_5","volume-title":"Computer Science Logic","author":"A Guglielmi","year":"2001","unstructured":"Guglielmi, A., Stra\u00dfburger, L.: Non-commutativity and MELL in the calculus of structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 54\u201368. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44802-0_5"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.4007\/annals.2006.164.1065","volume":"164","author":"D Hughes","year":"2006","unstructured":"Hughes, D.: Proofs Without Syntax. Ann. Math. 164(3), 1065\u20131076 (2006)","journal-title":"Ann. Math."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2006.05.036","volume":"165","author":"D Hughes","year":"2006","unstructured":"Hughes, D.: Towards Hilbert\u2019s 24$${}^{\\text{ th }}$$ problem: combinatorial proof invariants: (preliminary version). Electr. Notes Theor. Comput. Sci. 165, 37\u201363 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Hughes, D.J.: Unification nets: canonical proof net quantifiers. In: LICS 2018 (2018)","DOI":"10.1145\/3209108.3209159"},{"key":"32_CR13","unstructured":"Marin, S., Stra\u00dfburger, L.: Label-free modular systems for classical and intuitionistic modal logics. In: Advances in Modal Logic 10 (2014)"},{"issue":"3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(01)00175-X","volume":"294","author":"C Retor\u00e9","year":"2003","unstructured":"Retor\u00e9, C.: Handsome proof-nets: perfect matchings and cographs. Theor. Comput. Sci. 294(3), 473\u2013488 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR15","volume-title":"First-Order Logic","author":"RM Smullyan","year":"1995","unstructured":"Smullyan, R.M.: First-Order Logic. Courier Corporation, Massachusetts (1995)"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-540-73449-9_26","volume-title":"Term Rewriting and Applications","author":"L Stra\u00dfburger","year":"2007","unstructured":"Stra\u00dfburger, L.: A characterization of medial as rewriting rule. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 344\u2013358. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73449-9_26"},{"key":"32_CR17","unstructured":"Stra\u00dfburger, L.: Combinatorial flows and proof compression. Research report RR-9048, Inria Saclay (2017). https:\/\/hal.inria.fr\/hal-01498468"},{"key":"32_CR18","unstructured":"Stra\u00dfburger, L.: Combinatorial flows and their normalisation. In: Miller, D. (ed.) FSCD 2017. LIPIcs, vol. 84, pp. 31:1\u201331:17. Schloss Dagstuhl (2017)"},{"key":"32_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168717","volume-title":"Basic Proof Theory","author":"AS Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, vol. 43. Cambridge University Press, Cambridge (2000)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94205-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T19:35:03Z","timestamp":1661542503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94205-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319942049","9783319942056"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94205-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}