Free-variable tableaux for propositional modal logics

Studia Logica

Volumn 69, Issue 1, 2001, Pages 59-96

  Beckert, Bernhard ^a   Goré, Rajeev ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Automated deduction; Free variable tableaux; Modal logics; Modal theorem proving

Indexed keywords

EID: 18944398578     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1013886427723     Document Type: Article

References (29)

1. BALSINGER, P., and A. HEUERDING, 'Comparison of theorem provers for modal logics: Introduction and summary', in Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Oisterwijk, The Netherlands, LNCS 1397, Springer, 1998.
2. BECKERT, B., and R. GORE, 'Free variable tableaux for propositional modal logics', in Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Pont-à-Mousson, France, LNCS 1227, pages 91-106, Springer, 1997.
3. BECKERT, B., and R. GORE, 'leanK 2.0: Description for the comparison of theorem provers for modal logics', in Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Oisterwijk, The Netherlands, LNCS 1397, pages 33-34, Springer, 1998.
4. BECKERT, B., and R. GORE, 'System description: leanK 2.0', in Proceedings, 15th International Conference on Automated Deduction (CADE), Lindau, Germany, LNCS 1421, pages 51-55, Springer, 1998.
5. BECKERT, B., and R. HäHNLE, 'Analytic tableaux', in W. Bibel and P. H. Schmitt, editors, Automated Deduction - A Basis for Applications, volume I: Foundations, Kluwer, Dordrecht, 1998.
6. BECKERT, B., R. HäHNLE, P. OEL, and M. SULZMANN, 'The tableau-based theorem prover -4Pr, version 4.0', in Proceedings, 13th International Conference on Automated Deduction (CADE), New Brunswick, NJ, USA, LNCS 1104, pages 303-307, Springer, 1996.
7. BECKERT, B., and J. POSEGGA, 'leanT-4-4P: Lean tableau-based deduction', Journal of Automated Reasoning 15(3):339-358, 1995.
8. BENCIVENGA, E., 'Free logic', in D. Gabbay and F. Günthner, editors, Handbook of Philosophical Logic, volume 3, Kluwer, Dordrecht, 1986.
9. t : A free variable sequent system for tense logic Kt', Australian Computational Logic Workshop, February 2000.
10. D'AGOSTINO, M., D. GABBAY, and A. Russo, 'Grafting modalities onto substructural implication systems', Studia Logica 59:65-102, 1997.
11. FITTING, M., 'leanTAP revisited', Journal of Logic and Computation 8(1):33-47, 1998.
12. FITTING, M. C., Proof Methods for Modal and Intuitionistic Logics, volume 169 of Synthese Library, D. Reidel, Dordrecht, Holland, 1983.
13. FITTING, M. C., First-Order Logic and Automated Theorem Proving, Springer, second edition, 1996.
14. FRISCH, A., and R. SCHERL, 'A general framework for modal deduction', in J. Alien, R. Fikes, and E. Sandewall, editors, Proceedings, 2nd Conference on Principles of Knowledge Representation and Reasoning, Morgan-Kaufmann, 1991.
15. GABBAY, D., Labelled Deductive Systems, Oxford University Press, 1996.
16. GORE, R., 'Tableau methods for modal and temporal logics', in M. D'Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors, Handbook of Tableau Methods, Kluwer, Dordrecht, 1999.
17. GOVERNATORI, G., 'A reduplication and loop checking free proof system for S4', in Short Papers: TABLEAUX'96, number 154-96 in RI-DSI, Via Comelico 39, 20135 Milan, Italy, 1996, Department of Computer Science, University of Milan.
18. HEUERDING, A., M. SEYFRIED, and H. ZIMMERMANN, 'Efficient loop-check for backward proof search in some non-classical logics', in P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings, 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Terrasini, Palermo, Italy, LNCS 1071, pages 210-225, Springer, 1996.
19. JACKSON, P., and H. REICHGELT, 'A general proof method for first-order modal logic', in Proceedings, International Joint Conference on Artificial Intelligence (IJCAI), pages 942-944, 1987.
20. RANGER, S., Provability in Logic, Stockholm Studies in Philosophy, University of Stockholm, Almqvist and Wiksell, Sweden, 1957.
21. LETZ, R., J. SCHUMANN, S. BAYERL, and W. BIBEL, 'SETHEO: A high-performance theorem prover', Journal of Automated Reasoning 8(2):183-212, 1992.
22. MASSACCI, F., 'Strongly analytic tableaux for normal modal logics', in A. Bundy, editor, Proceedings, 12th International Conference on Automated Deduction (CADE), Nancy, France, LNCS 814, pages 723-737, Springer, 1994.
23. MASSACI, F., 'Simplification: A general constraint propagation technique for propositional and modal tableaux', in Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Oisterwijk, The Netherlands, LNCS 1397. Springer, 1998.
24. MINTS, G., A Short Introduction to Modal Logic, CSLI, Stanford, 1992.
25. OTTEN, J., 'ileanTAP: An intuitionistic theorem prover', in Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Pontà-Mousson, France, LNCS 1227, Springer, 1997.
26. PlTT, J., and J. CuNNINGHAM, 'Distributed modal theorem proving with KE', in M. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings, International Conference on Theorem Proving with Analytic Tableaux and Related Methods, Terrasini, Palermo, Italy, LNCS 1071, pages 160-176, Springer, 1996.
27. REEVES, S.V., 'Semantic tableaux as a framework for automated theorem-proving', in C. Mellish and J. Hallam, editors, Advances in Artificial Intelligence (Proceedings of AISB-87), pages 125-139, Wiley, 1987.
28. Russo, A., 'Generalising propositional modal logic using labelled deductive systems', in F. Baader and K. Schulz, editors, Proceedings, Frontiers of Combining Systems (FroCoS), Munich, Germany, volume 3 of Applied Logic Series, Kluwer, Dordrecht, 1996.
29. WALLEN, L. A., Automated Deduction in Nonclassical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics, MIT Press, 1989.