Abstract
A strong analytic tableau calculus is presentend for the most common normal modal logics. The method combines the advantages of both sequent-like tableaux and prefixed tableaux. Proper rules are used, instead of complex closure operations for the accessibility relation, while non determinism and cut rules, used by sequent-like tableaux, are totally eliminated. A strong completeness theorem without cut is also given for symmetric and euclidean logics. The system gains the same modularity of Hilbert-style formulations, where the addition or deletion of rules is the way to change logic. Since each rule has to consider only adjacent possible worlds, the calculus also gains efficiency. Moreover, the rules satisfy the strong Church Rosser property and can thus be fully parallelized. Termination properties and a general algorithm are devised. The propositional modal logics thus treated are K, D, T, KB, K4, K5, K45, KDB, D4, KD5, KD45, B, S4, S5, OM, OB, OK4, OS4, OM+, OB+, OK4+, OS4+. Other logics can be constructed with different combinations of the proposed rules, but are not presented here.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Catach. TABLEAUX, a general theorem prover for modal logics. J. of Automated Reasoning, 7, 1991.
F. Fitch. Tree proofs in modal logic. J. of Symbolic Logic, 31, 1966.
M. Fitting. Tableau methods of proof for modal logic. Notre Dame J. of Formal Logic, 13, 1972.
M. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht, 1983.
M. Fitting. First order modal tableaux. J. of Automated Reasoning, 4, 1991.
D. M. Gabbay. Labelled Deductive Systems. Oxford Univ. Press, Oxford, 1993.
I. Gent. Theory Matrices (for Modal Logics) Using Alphabetical Monotonicity. Studia Logica, 52, 1993.
R. Goré. Cut-free Sequent and Tableau Systems for Propositonal Normal Modal Logics. PhD thesis, Computer Laboratory, Univ. of Cambridge, 1992.
J. Y. Halpern and R. Fagin. Modelling knowledge and action in distributed systems. Distributed computing, 3(4), 1989.
J. Y. Halpern and Y. Moses. A guide to the modal logic of knowledge and belief. In Proc. of IJCAI-85, 1985.
G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. J. of the ACM, 1980.
G. E. Hughes and M. J. Cresswell. a Companion to Modal Logic. Methuen, London, 1984.
K. Konolige. On relation between default and autoepistemic logic. Artificial Intelligence, 35(3), 1988.
W. Marek, G. F. Schwarz, and M. Truszczynski. Modal nonmonotonic logics: ranges, characterization, computation. In Proc. of KR-91, San Matteo, CA, 1991.
F. Massacci. Ragionamento autoepistemico automatico. Tesi di Laurea, Fac. Ingegneria, Univ. di Roma “La Sapienza”, 1993. In Italian.
R. C. Moore. Possible world semantics for autoepistemic logic. In M. Ginsberg, editor, Readings on Nonmonotonic Reasoning. Morgan Kaufmann, 1990.
H. J. Ohlbach. A resolution calculus for modal logic. In Proc. of CADE-88, LNCS 310. Springer Verlag, 1988.
G. F. Schvarts. Gentzen style systems for K45 and K45D. In A. Meyer and M. Taitslin, editors, Logic at Botik '89, Symposium on Logical Foundations of Computer Science. LNCS 363. Springer-Verlag, 1989.
L. A. Wallen. Matrix proof methods for modal logics. In Proc. of IJCAI-87, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Massacci, F. (1994). Strongly analytic tableaux for normal modal logics. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_52
Download citation
DOI: https://doi.org/10.1007/3-540-58156-1_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58156-7
Online ISBN: 978-3-540-48467-7
eBook Packages: Springer Book Archive