Abstract
In Automated Deduction for non classical logics and specially for modal logics, efficient (and not only complete) strategies are needed. Ordering strategies are presented for the Fitting's tableaux calculi. Besides orderings of tableaux rules, different variants for backtracking are used. The strategies apply to most usual propositional modal logics: K, T, K4, S4, D, D4, C, CT, C4, CS4, CD, CD4, G. More precisely, they apply to logics for which there exists a tableaux calculus such that the number of sets of formulas introduced in a tree is finite -the analytic tableaux systems satisfy this requirement. The strategies are proved to be complete for most of these logics. The results are presented for S4. The strategies have been implemented and extensively experimented in the tableaux theorem prover running on our Inference Laboratory ATINF. Experiments have shown the efficiency of some of the proposed strategies.
This work has been supported by a grant of the French Ministry of Research and Space.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Y. Auffray, P. Enjalbert, and J-J. Herbrard. Strategies for modal resolution: results and problems. Journal of Automated Reasoning, 6:1–38, 1990.
L. Catach. TABLEAUX: A General Theorem Prover for Modal Logics. Journal of Automated Reasoning, 7:489–510, 1991.
R. Caferra and S. Demri. Cooperation between direct method and translation method in non classical logics: some results in propositional S5. In IJCAI-13, pages 74–79, 1993.
R. Caferra, S. Demri, and M. Herment. A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics. Studia Logica, 52(2):197–232, 1993.
R. Caferra and M. Herment. GLEFATINF: a graphic framework for combining theorem provers and editing proofs for different logics. In A. Miola, editor, DISCO'93, pages 229–240. Springer-Verlag, LNCS 722, 1993.
M. Cerioli and J. Meseguer. May I borrow your logic? In A. Borzyskowski and S. Sokolowski, editors, Mathematical Foundations of Computer Science, pages 342–351. Springer Verlag, LNCS 711, August 1993.
L. Dubikajtis and L. de Moraes. On single operator for Lewis S5 modal logic. Reports on Mathematical Logic, 11:57–61, 1981.
S. Demri. PhD thesis. Forthcoming.
S. Demri. Ordering strategies for tableau-based modal theorem provers. In IJCAI'93 Workshop on Executable Modal and Temporal Logics, 1993.
J. Delgrande and C. Groeneboer. Tableau-based theorem proving in normal conditional logics. In AAAI-7, pages 171–176, 1988.
A. M. Frisch and Scherl R. B. A constraint logic approach to modal deduction. In JELIA' 90, pages 234–250. Springer-Verlag, 1990.
L. Fariñas del Cerro. Un principe de résolution en logique modale. RAIRO, 18:161–170, 1983.
M. C. Fitting. Proof methods for modal and intuitionistic logics. D. Reidel Publishing Co., 1983.
M. C. Fitting. First-order modal tableaux. Journal of Automated Reasoning, 4:191–213, 1988.
G. E. Hughes and M. J. Cresswell. An introduction to modal logic. Methuen and Co., 1968.
A. Herzig. Raisonnement automatique en logique modale et algorithmes d'unification. PhD thesis, Université P. Sabatier, Toulouse, 1989.
J. Hintikka. Knowledge and Belief. Cornell University Press, 1962.
J. Y. Halpern and Y. Moses. A guide to the modal logics of knowledge and belief: preliminary draft. In IJCAI-9, pages 480–490, 1985.
K. Konolige. A deduction model of belief. Pitman, 1986.
K. Konolige. Resolution and quantified epistemic logics. In J. H. Siekmann, editor, CADES-8. Springer-Verlag, LNCS 230, 1986.
R. Kowalski. Search strategies for theorem-proving. Machine Intelligence, 5:181–201, 1969.
S. Kripke. Semantical considerations on modal logics. Modal and Manyvalued logics, Acta Philosophica Fennica, 1963.
T. Kaufl and N. Zabel. Cooperation of decision procedures in a tableaux-based theorem prover. Revue d'Intelligence Artificielle, Special Issue on Automated Deduction, 4(3):99–125, 1990.
R. E. Ladner. The computational complexity of provability in systems of modal prepositional logic. SIAM J. Comp., 6(3):467–480, September 1977.
P. W. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland, 1978.
K. Matsumoto. Reduction theorem in Lewis's sentential calculi. Mathematica Japonicae, 3:133–135, 1955.
J. McCarthy. Formalization of two puzzles involving knowledge. Stanford University, 1978.
H. Ohlbach. Optimized translation of multi modal logic into predicate logic. In A. Voronkov, editor, LPAR'93, pages 253–264. Springer-Verlag, LNAI 698, 1993.
E. Orlowska. Resolution systems and their applications I. Fundamenta Informaticae, 3:253–268, 1979.
E. Orlowska. Relational proof systems for some AI logics. In Ph. Jorrand and J. Kelemen, editors, FAIR'91, pages 33–47. Springer-Verlag, LNAI 535, 1991.
W. Rautenberg. Modal tableau calculi and interpolation. The Journal of Philosophical Logic, 12:403–423, 1983.
R. M. Smullyan. First-Order Logic. Springer-Verlag, 1968.
P. B. Thistlewaite, M. A. McRobbie, and R. K. Meyer. The kripke Automated Theorem Proving System. In CADE-8, pages 705–706. Springer-Verlag, LNCS 230, 1986.
L. A. Wallen. Automated Deduction in Nonclassical Logics. MIT Press, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demri, S. (1994). Efficient strategies for Automated reasoning in modal logics. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021972
Download citation
DOI: https://doi.org/10.1007/BFb0021972
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58332-5
Online ISBN: 978-3-540-48657-2
eBook Packages: Springer Book Archive