{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:37:59Z","timestamp":1782927479062,"version":"3.54.5"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030860585","type":"print"},{"value":"9783030860592","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86059-2_3","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T17:48:17Z","timestamp":1630432097000},"page":"38-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Analytic Tableaux for Non-deterministic Semantics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9716-3142","authenticated-orcid":false,"given":"Lukas","family":"Gr\u00e4tz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"key":"3_CR1","unstructured":"Avron, A., Arieli, O., Zamansky, A.: Theory of Effective Propositional Paraconsistent Logics. College Publications (2018)"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1093\/jigpal\/jzi030","volume":"13","author":"A Avron","year":"2005","unstructured":"Avron, A., Konikowska, B.: Multi-valued calculi for logics based on non-determinism. Log. J. IGPL 13(4), 365\u2013387 (2005). https:\/\/doi.org\/10.1093\/jigpal\/jzi030","journal-title":"Log. J. IGPL"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-45744-5_45","volume-title":"Automated Reasoning","author":"A Avron","year":"2001","unstructured":"Avron, A., Lev, I.: Canonical propositional Gentzen-type systems. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 529\u2013544. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_45"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/logcom\/exi001","volume":"15","author":"A Avron","year":"2005","unstructured":"Avron, A., Lev, I.: Non-deterministic multiple-valued structures. J. Log. Comput. 15(3), 241\u2013261 (2005). https:\/\/doi.org\/10.1093\/logcom\/exi001","journal-title":"J. Log. Comput."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-92687-0_3","volume-title":"Logical Foundations of Computer Science","author":"A Avron","year":"2008","unstructured":"Avron, A., Zamansky, A.: Canonical signed calculi, non-deterministic matrices and cut-elimination. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 31\u201345. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92687-0_3"},{"key":"3_CR6","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, vol. 16, 2nd edn, pp. 227\u2013304. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-94-007-0479-4_4","edition":"2"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Salzer, G.: Automated deduction for many-valued logics. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2, chap. 19, pp. 1355\u20131402. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50022-9"},{"key":"3_CR8","first-page":"192","volume":"51","author":"M Baaz","year":"1993","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Zach, R.: Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS 51, 192\u2013197 (1993)","journal-title":"Bull. EATCS"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-013-9273-x","volume":"51","author":"M Baaz","year":"2013","unstructured":"Baaz, M., Lahav, O., Zamansky, A.: Finite-valued semantics for canonical labelled calculi. J. Autom. Reason. 51(4), 401\u2013430 (2013). https:\/\/doi.org\/10.1007\/s10817-013-9273-x","journal-title":"J. Autom. Reason."},{"key":"3_CR10","series-title":"Applied Logic Series","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-94-011-4040-9_3","volume-title":"Labelled Deduction","author":"B Beckert","year":"2000","unstructured":"Beckert, B., H\u00e4hnle, R., Many\u00e0, F.: The SAT problem of signed CNF formulas. In: Basin, D., D\u2019Agostino, M., Gabbay, D.M., Matthews, S., Vigan\u00f2, L. (eds.) Labelled Deduction. APLS, vol. 17, pp. 59\u201380. Springer, Dordrecht (2000). https:\/\/doi.org\/10.1007\/978-94-011-4040-9_3"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"473","DOI":"10.2307\/2274395","volume":"52","author":"WA Carnielli","year":"1987","unstructured":"Carnielli, W.A.: Systematization of finite many-valued logics through the method of tableaux. J. Symb. Log. 52(2), 473\u2013493 (1987). https:\/\/doi.org\/10.2307\/2274395","journal-title":"J. Symb. Log."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1093\/jigpal\/jzz027","volume":"28","author":"ME Coniglio","year":"2020","unstructured":"Coniglio, M.E., del Cerro, L.F., Newton, M.P.: Modal logic with non-deterministic semantics: part I\u2013propositional case. Log. J. IGPL 28(3), 281\u2013315 (2020). https:\/\/doi.org\/10.1093\/jigpal\/jzz027","journal-title":"Log. J. IGPL"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"D\u2019Agostino, M., Mondadori, M.: The taming of the cut. Classical refutations with analytic cut. J. Log. Comput. 4(3), 285\u2013319 (1994). https:\/\/doi.org\/10.1093\/logcom\/4.3.285","DOI":"10.1093\/logcom\/4.3.285"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/logcom\/ext024","volume":"26","author":"CG Ferm\u00fcller","year":"2016","unstructured":"Ferm\u00fcller, C.G.: On matrices, Nmatrices and games. J. Log. Comput. 26(1), 189\u2013211 (2016). https:\/\/doi.org\/10.1093\/logcom\/ext024","journal-title":"J. Log. Comput."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-94-017-0452-6_5","volume-title":"Handbook of Philosophical Logic","author":"R H\u00e4hnle","year":"2001","unstructured":"H\u00e4hnle, R.: Advanced many-valued logics. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 2, 2nd edn, pp. 297\u2013395. Springer, Dordrecht (2001). https:\/\/doi.org\/10.1007\/978-94-017-0452-6_5","edition":"2"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-54487-9_62","volume-title":"Computer Science Logic","author":"R H\u00e4hnle","year":"1991","unstructured":"H\u00e4hnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics. In: B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M., Sch\u00f6nfeld, W. (eds.) CSL 1990. LNCS, vol. 533, pp. 248\u2013260. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54487-9_62"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-valued Logics. Oxford University Press (1993)","DOI":"10.1093\/oso\/9780198539896.001.0001"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Tableaux for many-valued logics. In: D\u2019Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 529\u2013580. Kluwer (1999)","DOI":"10.1007\/978-94-017-1754-0_9"},{"key":"3_CR19","unstructured":"Ivlev, J.V.: Modal\u2019naja logika. Moskovskogo Univ, Izdat (1991). (in Russian)"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1080\/11663081.1993.10510795","volume":"3","author":"B Konikowska","year":"1993","unstructured":"Konikowska, B.: Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus. J. Appl. Non-Classical Log. 3(1), 39\u201371 (1993). https:\/\/doi.org\/10.1080\/11663081.1993.10510795","journal-title":"J. Appl. Non-Classical Log."},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.4288\/jafpos1956.2.183","volume":"2","author":"M Ohnishi","year":"1964","unstructured":"Ohnishi, M., Matsumoto, K.: A system for strict implication. Ann. Jpn. Assoc. Philos. Sci. 2(4), 183\u2013188 (1964). https:\/\/doi.org\/10.4288\/jafpos1956.2.183","journal-title":"Ann. Jpn. Assoc. Philos. Sci."},{"issue":"5","key":"3_CR22","first-page":"815","volume":"3","author":"H Omori","year":"2016","unstructured":"Omori, H., Skurt, D.: More modal semantics without possible worlds. IfCoLog J. Log. Appl. 3(5), 815\u2013846 (2016)","journal-title":"IfCoLog J. Log. Appl."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Paoli, F.: Substructural Logics: A Primer. Trends in Logic. Kluwer Academic Publishers (2002)","DOI":"10.1007\/978-94-017-3179-9"},{"issue":"4","key":"3_CR24","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11787-020-00263-0","volume":"14","author":"P Pawlowski","year":"2020","unstructured":"Pawlowski, P.: Tree-like proof systems for finitely-many valued non-deterministic consequence relations. Log. Univers. 14(4), 407\u2013420 (2020). https:\/\/doi.org\/10.1007\/s11787-020-00263-0","journal-title":"Log. Univers."},{"key":"3_CR25","unstructured":"Rosser, J.B., Turquette, A.R.: Many-Valued Logics. North-Holland (1952)"},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.4064\/fm-60-1-23-33","volume":"60","author":"G Rouseau","year":"1967","unstructured":"Rouseau, G.: Sequents in many valued logic I. Fundam. Math. 60(1), 23\u201333 (1967). https:\/\/doi.org\/10.4064\/fm-60-1-23-33","journal-title":"Fundam. Math."},{"key":"3_CR27","unstructured":"Smullyan, R.M.: First-Order Logic. Dover, 2 edn. (1995)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Surma, S.J.: An algorithm for axiomatizing every finite logic. In: Rine, D.C. (ed.) Computer Science and Multiple-Valued Logic, pp. 137\u2013143. North-Holland Publishing Company (1977)","DOI":"10.1016\/B978-0-7204-0406-7.50009-0"},{"issue":"7","key":"3_CR29","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1016\/j.apal.2011.09.006","volume":"163","author":"A Zamansky","year":"2012","unstructured":"Zamansky, A., Avron, A.: Canonical signed calculi with multi-ary quantifiers. Ann. Pure Appl. Logic 163(7), 951\u2013960 (2012). https:\/\/doi.org\/10.1016\/j.apal.2011.09.006","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86059-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T02:39:34Z","timestamp":1699411174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86059-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030860585","9783030860592"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86059-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 August 2021","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":"Birmingham","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2021.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":"46","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":"23","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":"50% - 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":"4","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":"5","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)"}}]}}