{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:35Z","timestamp":1726042235827},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290252"},{"type":"electronic","value":"9783030290269"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_15","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"259-276","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards a Combinatorial Proof Theory"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Ralph","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":[[2019,8,14]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-319-94205-6_32","volume-title":"Automated Reasoning","author":"M Acclavio","year":"2018","unstructured":"Acclavio, M., Stra\u00dfburger, L.: From syntactic proofs to combinatorial proofs. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 481\u2013497. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_32"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-59533-6_1","volume-title":"Logic, Language, Information, and Computation","author":"M Acclavio","year":"2019","unstructured":"Acclavio, M., Stra\u00dfburger, L.: On combinatorial proofs for logics of relevance and entailment. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds.) WoLLIC 2019. LNCS, vol. 11541, pp. 1\u201316. Springer, Berlin Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-59533-6_1"},{"doi-asserted-by":"crossref","unstructured":"Acclavio, M., Stra\u00dfburger, L.: On Combinatorial proofs for modal logic. In: Cerrito, S., Popescu, A. (eds.) TABLEAUX 2019. LNAI 11714, pp. 223\u2013240 (2019)","key":"15_CR3","DOI":"10.1007\/978-3-030-29026-9_13"},{"unstructured":"Aler Tubella, A., Guglielmi, A., Ralph, B.: Removing cycles from proofs. In: Goranko, V., Dam, M. (eds.) 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 82, pp. 9:1\u20139:17. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)","key":"15_CR4"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1305\/ndjfl\/1168352668","volume":"47","author":"K Br\u00fcnnler","year":"2006","unstructured":"Br\u00fcnnler, K.: Locality for classical logic. Notre Dame J. Form. Log. 47(4), 557\u2013580 (2006)","journal-title":"Notre Dame J. Form. Log."},{"key":"15_CR6","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":"5","key":"15_CR7","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ic.2009.01.007","volume":"208","author":"A Carbone","year":"2010","unstructured":"Carbone, A.: A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs. Inf. Comput. 208(5), 500\u2013509 (2010)","journal-title":"Inf. Comput."},{"issue":"01","key":"15_CR8","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. Log. 44(01), 36\u201350 (1979)","journal-title":"J. Symb. Log."},{"unstructured":"Das, A.: Rewriting with linear inferences in propositional logic. In: RTA, pp. 158\u2013173 (2013)","key":"15_CR9"},{"unstructured":"Das, A., Stra\u00dfburger, L.: No complete linear term rewriting system for propositional logic. In: 26th International Conference on Rewriting Techniques and Applications (RTA), Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2015)","key":"15_CR10"},{"issue":"4:9","key":"15_CR11","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:9), 1\u201327 (2016)","journal-title":"Log. Methods Comput. Sci."},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1182613.1182614","volume":"8","author":"A Guglielmi","year":"2007","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Trans. Comput. Log. 8(1), 1\u201364 (2007)","journal-title":"ACM Trans. Comput. Log."},{"unstructured":"Guglielmi, A., Gundersen, T., Parigot, M.: A proof calculus which reduces syntactic bureaucracy. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010), pp. 6:135\u2013150 (2010)","key":"15_CR14"},{"key":"15_CR15","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"},{"unstructured":"Heijltjes, W., Hughes, D.J.D., Stra\u00dfburger, L.: Intuitionistic combinatorial proofs. In: LICS (2019)","key":"15_CR16"},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.4007\/annals.2006.164.1065","volume":"164","author":"DJD Hughes","year":"2006","unstructured":"Hughes, D.J.D.: Proofs without syntax. Ann. Math. 164(3), 1065\u20131076 (2006)","journal-title":"Ann. Math."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2006.05.036","volume":"165","author":"DJD Hughes","year":"2006","unstructured":"Hughes, D.J.D.: Towards Hilbert\u2019s 24th problem: combinatorial proof invariants: (preliminary version). Electron. Notes Theor. Comput. Sci. 165, 37\u201363 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"unstructured":"Hughes, D.J.D.: First-order proofs without syntax. arXiv:1906.11236 [math], June 2019","key":"15_CR19"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-62688-3_43","volume-title":"Typed Lambda Calculi and Applications","author":"C Retor\u00e9","year":"1997","unstructured":"Retor\u00e9, C.: Pomset logic: a non-commutative extension of classical linear logic. In: de Groote, P., Roger Hindley, J. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 300\u2013318. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62688-3_43"},{"unstructured":"Retor\u00e9, C.: Handsome proof-nets: R&B-graphs, perfect matchings and series-parallel graphs. Ph.D. thesis, INRIA (1999)","key":"15_CR21"},{"issue":"3","key":"15_CR22","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."},{"unstructured":"Stra\u00dfburger, L.: Linear logic and noncommutativity in the calculus of structures. Ph.D. thesis, Technischen Universit\u00e4t Dresden (2003)","key":"15_CR23"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0304-3975(03)00240-8","volume":"309","author":"L Stra\u00dfburger","year":"2003","unstructured":"Stra\u00dfburger, L.: MELL in the calculus of structures. Theor. Comput. Sci. 309(1), 213\u2013285 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR25","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"},{"unstructured":"Stra\u00dfburger, L.: Combinatorial flows and their normalisation. In: LIPIcs-Leibniz International Proceedings in Informatics. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol. 84 (2017)","key":"15_CR26"},{"issue":"2140","key":"15_CR27","doi-asserted-by":"publisher","first-page":"20180038","DOI":"10.1098\/rsta.2018.0038","volume":"377","author":"L Stra\u00dfburger","year":"2019","unstructured":"Stra\u00dfburger, L.: The problem of proof identity, and why computer scientists should care about Hilbert\u2019s 24th problem. Philos. Trans. R. Soc. A 377(2140), 20180038 (2019)","journal-title":"Philos. Trans. R. Soc. A"},{"issue":"4","key":"15_CR28","first-page":"1","volume":"12","author":"L Stra\u00dfburger","year":"2011","unstructured":"Stra\u00dfburger, L., Guglielmi, A.: A system of interaction and structure IV: the exponentials and decomposition. ACM Trans. Comput. Log. 12(4), 1\u201339 (2011)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"15_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00029890.2003.11919933","volume":"110","author":"R Thiele","year":"2003","unstructured":"Thiele, R.: Hilbert\u2019s twenty-fourth problem. Am. Math. Mon. 110(1), 1\u201324 (2003)","journal-title":"Am. Math. Mon."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T17:41:59Z","timestamp":1575567719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}