Abstract
Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In this paper, we introduce a sequent-type calculus for a variant of default logic employing Łukasiewicz’s three-valued logic as the underlying base logic. This version of default logic has been introduced by Radzikowska addressing some representational shortcomings of standard default logic. More specifically, our calculus axiomatises brave reasoning for this version of default logic, following the sequent method first introduced in the context of nonmonotonic reasoning by Bonatti, which employs a complementary calculus for axiomatising invalid formulas, taking care of expressing the consistency condition of defaults.
The first author was supported by the European Master’s Program in Computational Logic (EMCL).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
\({\mathsf {S}{{\textsf {\L }}}_3}\) has optimised rules for \(\,\supset \,\) compared to those of the calculus for \({\mathbf{\L }_\mathbf {3}}\) given by Malinowski [22]; also note that \({\mathsf {S}{{\textsf {\L }}}_3}\) does not require a cut rule.
References
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–231 (1996)
Avron, A.: Natural 3-valued logics - Characterization and proof theory. J. Symb. Log. 56(1), 276–294 (1991)
Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications, pp. 1–32. Clarendon Press (1996)
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–151. Springer, Heidelberg (2002). https://doi.org/10.1007/978-3-7908-1769-0_5
Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of reasoning for fragments of default logic. J. Log. Comput. 22(3), 587–604 (2012)
Béziau, J.Y.: A sequent calculus for Lukasiewicz’s three-valued logic based on Suszko’s bivalent semantics. Bull. Sect. Log. 28(2), 89–97 (1999)
Bogojeski, M.: Gentzen-type Refutation Systems for Finite-valued Logics. Bachelor’s thesis, Technische Universität Wien, Institut für Informationssysteme (2014)
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–142. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61208-4_9
Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Transact. Comput. Log. 3(2), 226–278 (2002)
Cabalar, P., Odintsov, S.P., Pearce, D., Valverde, A.: Partial equilibrium logic. Ann. Math. Artif. Intell. 50(3–4), 305–331 (2007)
Carnielli, W.A.: On sequents and tableaux for many-valued logics. J. Non-Class. Log. 8(1), 59–76 (1991)
Delgrande, J., Schaub, T., Jackson, W.: Alternative approaches to default logic. Artif. Intell. 70(1–2), 167–237 (1994)
Egly, U., Tompits, H.: A sequent calculus for intuitionistic default logic. In: Proceedings of WLP 1997, pp. 69–79. Forschungsbericht PMS-FB-1997-10, Institut für Informatik, Ludwig-Maximilians-Universität München (1997)
Gebser, M., Schaub, T.: Tableau calculi for logic programs under answer set semantics. ACM Transact. Comput. Log. 14(2), 15:1–15:40 (2013)
Gentzen, G.: Untersuchungen über das logische Schließen I. Math. Z. 39(1), 176–210 (1935)
Hähnle, R.: Tableaux for many-valued logics. In: Handbook of Tableaux Methods, pp. 529–580. Kluwer (1999)
Łukasiewicz, J.: Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenkalküls. Comptes rendus des séances de la Société des Sciences et des Lettres de Varsovie Cl. 3(23), 51–77 (1930)
Łukasiewicz, J.: O sylogistyce Arystotelesa. Sprawozdania z Czynności i Posiedzeń Polskiej Akademii Umiejȩtności 44, 220–227 (1939)
Łukaszewicz, W.: Considerations on default logic - An alternative approach. Comput. Intell. 4, 1–16 (1988)
Łukaszewicz, W.: Non-Monotonic Reasoning: Formalization of Commonsense Reasoning. Ellis Horwood Series in Artificial Intelligence. Ellis Horwood, Chichester (1990)
Lupea, M.: Axiomatization of credulous reasoning in default logics using sequent calculus. In: Proceedings of SYNASC 2008. IEEE Xplore (2008)
Malinowski, G.: Many-valued logic and its philosophy. In: Handbook of the History of Logic, vol. 8, pp. 13–94. North-Holland (2007)
Marek, W., Truszczyński, M.: Nonmonotonic Logic: Context-Dependent Reasoning. Springer, Berlin (1993). https://doi.org/10.1007/978-3-662-02906-0
McCarthy, J.: Circumscription - A form of non-monotonic reasoning. Artif. Intell. 13, 27–39 (1980)
Moore, R.C.: Semantical considerations on nonmonotonic logic. Artif. Intell. 25, 75–94 (1985)
Niemelä, I.: Implementing circumscription using a tableau method. In: Proceedings of ECAI 1996, pp. 80–84. Wiley (1996)
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–259. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9_28
Pearce, D., de Guzmán, I.P., Valverde, A.: A tableau calculus for equilibrium entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS (LNAI), vol. 1847, pp. 352–367. Springer, Heidelberg (2000). https://doi.org/10.1007/10722086_28
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, San Mateo (1988)
Radzikowska, A.: A three-valued approach to default logic. J. Appl. Non-Class. Log. 6(2), 149–190 (1996)
Reiter, R.: A logic for default reasoning. Artif. Intell. 13, 81–132 (1980)
Rosser, J.B., Turquette, A.R.: Many-valued Logics. North-Holland, Amsterdam (1952)
Rousseau, G.: Sequents in many valued logic I. Fundamenta Math. 60, 23–33 (1967)
Schaub, T.: On constrained default theories. Technical report AIDA-92-2, FG Intellektik, FB Informatik, TH Darmstadt (1992)
Tompits, H.: On Proof Complexities of First-Order Nonmonotonic Logics. Ph.D. thesis, Technische Universität Wien, Institut für Informationssysteme (1998)
Wajsberg, M.: Aksjomatyzacja trójwartościowego rachunku zdań. Comptes rendus des séances de la Société des Sciences et des Lettres de Varsovie Cl. 3(24), 136–148 (1931)
Zach, R.: Proof Theory of Finite-valued Logics. Master’s thesis, Technische Universität Wien, Institut für Computersprachen (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Pkhakadze, S., Tompits, H. (2019). A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur. In: Balduccini, M., Lierler, Y., Woltran, S. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2019. Lecture Notes in Computer Science(), vol 11481. Springer, Cham. https://doi.org/10.1007/978-3-030-20528-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-20528-7_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20527-0
Online ISBN: 978-3-030-20528-7
eBook Packages: Computer ScienceComputer Science (R0)