{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:06:25Z","timestamp":1743123985542,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030205270"},{"type":"electronic","value":"9783030205287"}],"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-20528-7_13","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:34:37Z","timestamp":1558362877000},"page":"163-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2247-8147","authenticated-orcid":false,"given":"Sopo","family":"Pkhakadze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5673-2460","authenticated-orcid":false,"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,12]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1093\/logcom\/6.2.205","volume":"6","author":"G Amati","year":"1996","unstructured":"Amati, G., Aiello, L.C., Gabbay, D., Pirri, F.: A proof theoretical approach to default reasoning I: Tableaux for default logic. J. Log. Comput. 6(2), 205\u2013231 (1996)","journal-title":"J. Log. Comput."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"276","DOI":"10.2307\/2274919","volume":"56","author":"A Avron","year":"1991","unstructured":"Avron, A.: Natural 3-valued logics - Characterization and proof theory. J. Symb. Log. 56(1), 276\u2013294 (1991)","journal-title":"J. Symb. Log."},{"doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications, pp. 1\u201332. Clarendon Press (1996)","key":"13_CR3","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-7908-1769-0_5","volume-title":"Theory and Applications in Multiple-Valued Logics","author":"A Avron","year":"2002","unstructured":"Avron, A.: Classical Gentzen-type methods in propositional many-valued logics. In: Fitting, M., Orlowska, E. (eds.) Theory and Applications in Multiple-Valued Logics, pp. 113\u2013151. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-7908-1769-0_5"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1093\/logcom\/exq061","volume":"22","author":"O Beyersdorff","year":"2012","unstructured":"Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of default logic. J. Log. Comput. 22(3), 587\u2013604 (2012)","journal-title":"J. Log. Comput."},{"issue":"2","key":"13_CR6","first-page":"89","volume":"28","author":"JY B\u00e9ziau","year":"1999","unstructured":"B\u00e9ziau, J.Y.: A sequent calculus for Lukasiewicz\u2019s three-valued logic based on Suszko\u2019s bivalent semantics. Bull. Sect. Log. 28(2), 89\u201397 (1999)","journal-title":"Bull. Sect. Log."},{"unstructured":"Bogojeski, M.: Gentzen-type Refutation Systems for Finite-valued Logics. Bachelor\u2019s thesis, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme (2014)","key":"13_CR7"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-61208-4_9","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"PA Bonatti","year":"1996","unstructured":"Bonatti, P.A.: Sequent calculi for default and autoepistemic logics. In: Miglioli, P., Moscato, U., Mundici, D., Ornaghi, M. (eds.) TABLEAUX 1996. LNCS, vol. 1071, pp. 127\u2013142. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61208-4_9"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/505372.505374","volume":"3","author":"PA Bonatti","year":"2002","unstructured":"Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Transact. Comput. Log. 3(2), 226\u2013278 (2002)","journal-title":"ACM Transact. Comput. Log."},{"issue":"3\u20134","key":"13_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10472-007-9075-0","volume":"50","author":"P Cabalar","year":"2007","unstructured":"Cabalar, P., Odintsov, S.P., Pearce, D., Valverde, A.: Partial equilibrium logic. Ann. Math. Artif. Intell. 50(3\u20134), 305\u2013331 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"13_CR11","first-page":"59","volume":"8","author":"WA Carnielli","year":"1991","unstructured":"Carnielli, W.A.: On sequents and tableaux for many-valued logics. J. Non-Class. Log. 8(1), 59\u201376 (1991)","journal-title":"J. Non-Class. Log."},{"issue":"1\u20132","key":"13_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(94)90106-6","volume":"70","author":"J Delgrande","year":"1994","unstructured":"Delgrande, J., Schaub, T., Jackson, W.: Alternative approaches to default logic. Artif. Intell. 70(1\u20132), 167\u2013237 (1994)","journal-title":"Artif. Intell."},{"unstructured":"Egly, U., Tompits, H.: A sequent calculus for intuitionistic default logic. In: Proceedings of WLP 1997, pp. 69\u201379. Forschungsbericht PMS-FB-1997-10, Institut f\u00fcr Informatik, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen (1997)","key":"13_CR13"},{"issue":"2","key":"13_CR14","first-page":"15:1","volume":"14","author":"M Gebser","year":"2013","unstructured":"Gebser, M., Schaub, T.: Tableau calculi for logic programs under answer set semantics. ACM Transact. Comput. Log. 14(2), 15:1\u201315:40 (2013)","journal-title":"ACM Transact. Comput. Log."},{"issue":"1","key":"13_CR15","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(1), 176\u2013210 (1935)","journal-title":"Math. Z."},{"doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Tableaux for many-valued logics. In: Handbook of Tableaux Methods, pp. 529\u2013580. Kluwer (1999)","key":"13_CR16","DOI":"10.1007\/978-94-017-1754-0_9"},{"issue":"23","key":"13_CR17","first-page":"51","volume":"3","author":"J \u0141ukasiewicz","year":"1930","unstructured":"\u0141ukasiewicz, J.: Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenkalk\u00fcls. Comptes rendus des s\u00e9ances de la Soci\u00e9t\u00e9 des Sciences et des Lettres de Varsovie Cl. 3(23), 51\u201377 (1930)","journal-title":"Comptes rendus des s\u00e9ances de la Soci\u00e9t\u00e9 des Sciences et des Lettres de Varsovie Cl."},{"key":"13_CR18","first-page":"220","volume":"44","author":"J \u0141ukasiewicz","year":"1939","unstructured":"\u0141ukasiewicz, J.: O sylogistyce Arystotelesa. Sprawozdania z Czynno\u015bci i Posiedze\u0144 Polskiej Akademii Umiej\u0229tno\u015bci 44, 220\u2013227 (1939)","journal-title":"Sprawozdania z Czynno\u015bci i Posiedze\u0144 Polskiej Akademii Umiej\u0229tno\u015bci"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1467-8640.1988.tb00086.x","volume":"4","author":"W \u0141ukaszewicz","year":"1988","unstructured":"\u0141ukaszewicz, W.: Considerations on default logic - An alternative approach. Comput. Intell. 4, 1\u201316 (1988)","journal-title":"Comput. Intell."},{"key":"13_CR20","series-title":"Ellis Horwood Series in Artificial Intelligence","volume-title":"Non-Monotonic Reasoning: Formalization of Commonsense Reasoning","author":"W \u0141ukaszewicz","year":"1990","unstructured":"\u0141ukaszewicz, W.: Non-Monotonic Reasoning: Formalization of Commonsense Reasoning. Ellis Horwood Series in Artificial Intelligence. Ellis Horwood, Chichester (1990)"},{"doi-asserted-by":"crossref","unstructured":"Lupea, M.: Axiomatization of credulous reasoning in default logics using sequent calculus. In: Proceedings of SYNASC 2008. IEEE Xplore (2008)","key":"13_CR21","DOI":"10.1109\/SYNASC.2008.43"},{"doi-asserted-by":"crossref","unstructured":"Malinowski, G.: Many-valued logic and its philosophy. In: Handbook of the History of Logic, vol. 8, pp. 13\u201394. North-Holland (2007)","key":"13_CR22","DOI":"10.1016\/S1874-5857(07)80004-5"},{"key":"13_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02906-0","volume-title":"Nonmonotonic Logic: Context-Dependent Reasoning","author":"W Marek","year":"1993","unstructured":"Marek, W., Truszczy\u0144ski, M.: Nonmonotonic Logic: Context-Dependent Reasoning. Springer, Berlin (1993). https:\/\/doi.org\/10.1007\/978-3-662-02906-0"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription - A form of non-monotonic reasoning. Artif. Intell. 13, 27\u201339 (1980)","journal-title":"Artif. Intell."},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"RC Moore","year":"1985","unstructured":"Moore, R.C.: Semantical considerations on nonmonotonic logic. Artif. Intell. 25, 75\u201394 (1985)","journal-title":"Artif. Intell."},{"unstructured":"Niemel\u00e4, I.: Implementing circumscription using a tableau method. In: Proceedings of ECAI 1996, pp. 80\u201384. Wiley (1996)","key":"13_CR26"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-20895-9_28","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Oetsch","year":"2011","unstructured":"Oetsch, J., Tompits, H.: Gentzen-type refutation systems for three-valued logics with an application to disproving strong equivalence. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 254\u2013259. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9_28"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/10722086_28","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"D Pearce","year":"2000","unstructured":"Pearce, D., de Guzm\u00e1n, I.P., Valverde, A.: A tableau calculus for equilibrium entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS (LNAI), vol. 1847, pp. 352\u2013367. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722086_28"},{"key":"13_CR29","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, San Mateo (1988)"},{"issue":"2","key":"13_CR30","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1080\/11663081.1996.10510876","volume":"6","author":"A Radzikowska","year":"1996","unstructured":"Radzikowska, A.: A three-valued approach to default logic. J. Appl. Non-Class. Log. 6(2), 149\u2013190 (1996)","journal-title":"J. Appl. Non-Class. Log."},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artif. Intell. 13, 81\u2013132 (1980)","journal-title":"Artif. Intell."},{"key":"13_CR32","volume-title":"Many-valued Logics","author":"JB Rosser","year":"1952","unstructured":"Rosser, J.B., Turquette, A.R.: Many-valued Logics. North-Holland, Amsterdam (1952)"},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.4064\/fm-60-1-23-33","volume":"60","author":"G Rousseau","year":"1967","unstructured":"Rousseau, G.: Sequents in many valued logic I. Fundamenta Math. 60, 23\u201333 (1967)","journal-title":"Fundamenta Math."},{"unstructured":"Schaub, T.: On constrained default theories. Technical report AIDA-92-2, FG Intellektik, FB Informatik, TH Darmstadt (1992)","key":"13_CR34"},{"unstructured":"Tompits, H.: On Proof Complexities of First-Order Nonmonotonic Logics. Ph.D. thesis, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme (1998)","key":"13_CR35"},{"issue":"24","key":"13_CR36","first-page":"136","volume":"3","author":"M Wajsberg","year":"1931","unstructured":"Wajsberg, M.: Aksjomatyzacja tr\u00f3jwarto\u015bciowego rachunku zda\u0144. Comptes rendus des s\u00e9ances de la Soci\u00e9t\u00e9 des Sciences et des Lettres de Varsovie Cl. 3(24), 136\u2013148 (1931)","journal-title":"Comptes rendus des s\u00e9ances de la Soci\u00e9t\u00e9 des Sciences et des Lettres de Varsovie Cl."},{"unstructured":"Zach, R.: Proof Theory of Finite-valued Logics. Master\u2019s thesis, Technische Universit\u00e4t Wien, Institut f\u00fcr Computersprachen (1993)","key":"13_CR37"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20528-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T08:37:44Z","timestamp":1721291864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20528-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030205270","9783030205287"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20528-7_13","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":"12 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philadelphia, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.sju.edu\/plw\/lpnmr-2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}