{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:23Z","timestamp":1726042223901},"publisher-location":"Cham","reference-count":14,"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_5","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"77-93","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["First-Order Quasi-canonical Proof Systems"],"prefix":"10.1007","author":[{"given":"Yotam","family":"Dvir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnon","family":"Avron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Avron, A.: Quasi-canonical systems and their semantics. Synthese, pp. 1\u201319, December 2018. https:\/\/doi.org\/10.1007\/s11229-018-02045-0","DOI":"10.1007\/s11229-018-02045-0"},{"issue":"1","key":"5_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2011-615","volume":"114","author":"A Avron","year":"2012","unstructured":"Avron, A., Konikowska, B.: Finite-valued logics for information processing. Fund. Inform. 114(1), 1\u201330 (2012)","journal-title":"Fund. Inform."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-79709-8_9","volume-title":"Computer Science \u2013 Theory and Applications","author":"A Avron","year":"2008","unstructured":"Avron, A., Zamansky, A.: A triple correspondence in canonical calculi: strong cut-elimination, coherence, and non-deterministic semantics. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 52\u201363. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79709-8_9"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-94-007-0479-4_4","volume-title":"Handbook of philosophical logic","author":"A Avron","year":"2011","unstructured":"Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems. In: Gabbay, D., Guenthner, F. (eds.) Handbook of philosophical logic, pp. 227\u2013304. Springer, Dordrecht (2011). https:\/\/doi.org\/10.1007\/978-94-007-0479-4_4"},{"key":"5_CR5","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1999","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)"},{"key":"5_CR6","volume-title":"Contemporary Aspects of Philosophy","author":"ND Belnap","year":"1977","unstructured":"Belnap, N.D.: How a computer should think. In: Ryle, G. (ed.) Contemporary Aspects of Philosophy. Oriel Press, Stockfield (1977)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-94-010-1161-7_2","volume-title":"Modern Uses of Multiple-Valued Logic","author":"ND Belnap","year":"1977","unstructured":"Belnap, N.D.: A useful four-valued logic. In: Dunn, J.M., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic, pp. 5\u201337. Springer, Dordrecht (1977). https:\/\/doi.org\/10.1007\/978-94-010-1161-7_2"},{"issue":"8","key":"5_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.12775\/LLP.2000.008","volume":"8","author":"W Carnielli","year":"2004","unstructured":"Carnielli, W., Marcos, J., de Amo, S.: Formal inconsistency and evolutionary databases. Logic Logical Philos. 8(8), 115\u2013152 (2004). https:\/\/apcz.umk.pl\/czasopisma\/index.php\/LLP\/article\/view\/LLP.2000.008","journal-title":"Logic Logical Philos."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-22119-4_11","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A Ciabattoni","year":"2011","unstructured":"Ciabattoni, A., Lahav, O., Zamansky, A.: Basic constructive connectives, determinism and matrix-based semantics. In: Br\u00fcnnler, K., Metcalfe, G. (eds.) Automated Reasoning with Analytic Tableaux and Related Methods, pp. 119\u2013133. Springer, Heidelberg (2011)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s11225-006-6607-2","volume":"82","author":"A Ciabattoni","year":"2006","unstructured":"Ciabattoni, A., Terui, K.: Towards a semantic characterization of cut-elimination. Stud. Logica 82(1), 95\u2013119 (2006). https:\/\/doi.org\/10.1007\/s11225-006-6607-2","journal-title":"Stud. Logica"},{"key":"5_CR11","unstructured":"Dunn, J.M.: The Algebra of Intensional Logics. Ph.D. thesis, University of Pittsburgh (1966)"},{"issue":"4","key":"5_CR12","first-page":"288","volume":"1","author":"G Gentzen","year":"1964","unstructured":"Gentzen, G.: Investigations into logical deduction. Am. Philos. Q. 1(4), 288\u2013306 (1964). http:\/\/www.jstor.org\/stable\/20009142","journal-title":"Am. Philos. Q."},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00215627","volume":"5","author":"A Sch\u00f6ter","year":"1996","unstructured":"Sch\u00f6ter, A.: Evidential bilattice logic and lexical inference. J. Logic Lang. Inform. 5(1), 65\u2013105 (1996). https:\/\/doi.org\/10.1007\/BF00215627","journal-title":"J. Logic Lang. Inform."},{"key":"5_CR14","volume-title":"Mathematical Logic","author":"JR Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical Logic. Addison-Wesley Pub. Co., Reading (1967)"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T22:41:41Z","timestamp":1575585701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_5","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)"}}]}}