{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:38:01Z","timestamp":1743140281364,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"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-662-59533-6_1","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T23:02:35Z","timestamp":1561244555000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Combinatorial Proofs for Logics of Relevance and Entailment"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Acclavio","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"1_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":"1_CR2","volume-title":"Entailment: The Logic of Relevance and Necessity","author":"AR Anderson","year":"1975","unstructured":"Anderson, A.R., Belnap Jr., N.D.: Entailment: The Logic of Relevance and Necessity, vol. 1. Princeton University Press, Princeton (1975)"},{"key":"1_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400887071","volume-title":"Entailment, Vol. II: The Logic of Relevance and Necessity","author":"AR Anderson","year":"2017","unstructured":"Anderson, A.R., Belnap Jr., N.D., Dunn, J.M.: Entailment, Vol. II: The Logic of Relevance and Necessity, vol. 5009. Princeton University Press, Princeton (2017)"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"ND Belnap Jr","year":"1982","unstructured":"Belnap Jr., N.D.: Display logic. J. Philos. Log. 11, 375\u2013417 (1982)","journal-title":"J. Philos. Log."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/malq.19650110403","volume":"11","author":"ND Belnap Jr","year":"1965","unstructured":"Belnap Jr., N.D., Wallace, J.R.: A decision procedure for the system $$e_{\\bar{i}}$$ of entailmengt with negation. Zeitschrift f\u00fcr Math. Log. Grundlagen der Math. 11, 277\u2013289 (1965)","journal-title":"Zeitschrift f\u00fcr Math. Log. Grundlagen der Math."},{"key":"1_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":"1","key":"1_CR7","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(1), 36\u201350 (1979)","journal-title":"J. Symb. Log."},{"issue":"2","key":"1_CR8","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":"1_CR9","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. Math. Z. 39, 176\u2013210 (1935)","journal-title":"Math. Z."},{"key":"1_CR10","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"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Heijltjes, W., Hughes, D., Stra\u00dfburger, L.: Intuitionistic proofs without syntax. In: LICS 2019 (2019)","DOI":"10.1109\/LICS.2019.8785827"},{"issue":"3","key":"1_CR12","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":"1_CR13","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 24th problem: combinatorial proof invariants: (preliminary version). Electron. Notes Theor. Comput. Sci. 165, 37\u201363 (2006)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00370441","volume":"38","author":"MA McRobbie","year":"1979","unstructured":"McRobbie, M.A., Belnap, N.D.: Relevant analytic tableaux. Stud. Log. 38(2), 187\u2013200 (1979)","journal-title":"Stud. Log."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-94-009-2639-4_4","volume-title":"Algorithms and Order","author":"RH M\u00f6hring","year":"1989","unstructured":"M\u00f6hring, R.H.: Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 105\u2013194. Kluwer Academic Publishers, Dordrecht (1989)"},{"issue":"3","key":"1_CR16","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":"1_CR17","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":"1_CR18","unstructured":"Stra\u00dfburger, L.: Combinatorial flows and their normalisation. In: Miller, D. (ed.) 2nd International Conference on Formal Structures for Computation and Deduction, FSCD 2017. LIPIcs, Oxford, UK, 3\u20139 September 2017, vol. 84, pp. 31:1\u201331:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"2140","key":"1_CR19","doi-asserted-by":"publisher","first-page":"20180038","DOI":"10.1098\/rsta.2018.0038","volume":"377","author":"Lutz 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. Roy. Soc. A 377 (2019)","journal-title":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T11:33:33Z","timestamp":1610019213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_1","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":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"60","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":"41","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":"6","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":"68% - 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":"2,3","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":"8","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)"}}]}}