Decidability by resolution for propositional modal logics

Journal of Automated Reasoning

Volumn 22, Issue 4, 1999, Pages 379-396

  Schmidt, Renate A ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DECISION THEORY; MODAL ANALYSIS; THEOREM PROVING;

PROPOSITIONAL MODAL LOGICS; RESOLUTION DECISION METHODS;

COMPUTABILITY AND DECIDABILITY;

EID: 0033123386     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006043519663     Document Type: Article

References (30)

1. Auffray, Y. and Enjalbert, P.: Modal theorem proving: An equational viewpoint, J. Logic Comput. 2(3) (1992), 247-297.
2. Bachmair, L., Ganzinger, H. and Waldmann, U.: Superposition with simplification as a decision procedure for the monadic class with equality, in G. Gottlob, A. Leitsch and D. Mundici (eds), Proceedings of the Third Kurt Gödel Colloquium (KGC'93), Lecture Notes in Comput. Sci. 713, Springer, 1993, pp. 83-96.
3. Donini, F. M., Lenzerini, M., Nardi, D. and Schaerf, A.: Reasoning in description logics, in G. Brewka (ed.), Principles in Knowledge Representation, Studies in Logic, Language and Information, CSLI Publications, Stanford, 1996, pp. 191-236.
4. Farinas del Cerro, L. and Herzig, A.: Linear modal deductions, in E. Lusk and R. Overbeek (eds), Automated Deduction: CADE-9, Lecture Notes in Comput. Sci. 310, Springer, 1988, pp. 487-499.
5. Farinas del Cerro, L. and Herzig, A.: Automated quantified modal logic, in P. B. Brazdil and K. Konolige (eds), Machine Learning, Meta-Reasoning and Logics, Kluwer, 1989, pp. 301-317.
6. Farinas del Cerro, L. and Herzig, A.: Modal deduction with applications in epistemic and temporal logics, in D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds), Handbook of Logic in Artificial Intelligence and Logic Programming: Epistemic and Temporal Reasoning, Vol. 4., Clarendon Press, Oxford, 1995, pp. 499-594.
7. Fermüller, C., Leitsch, A., Tammet, T. and Zamov, N.: Resolution Method for the Decision Problem, Lecture Notes in Comput. Sci. 679, Springer, 1993.
8. Gottlob, G. and Fermüller, C. G.: Removing redundancy from a clause, Artif. Intell. 61 (1993), 263-289.
9. Herzig, A.: Raisonnement automatique en logique modale et algorithmes d'unification, Ph.D. Thesis, Univ. Paul-Sabatier, Toulouse, 1989.
10. Herzig, A.: A new decidable fragment of first order logic, 1990, in Abstracts of the Third Logical Biennal, Summer School and Conference in honour of S. C. Kleene, Varna, Bulgaria.
11. Hustadt, U.: Resolution-based decision procedures for subclasses of first-order logic, Forthcoming Ph.D. Thesis, Univ. Saarlandes, Germany, 1998.
12. Hustadt, U. and Schmidt, R. A.: An empirical analysis of modal theorem provers, Preprint, 1997, to appear in J. Applied Non-Classical Logic.
13. Hustadt, U. and Schmidt, R. A.: On evaluating decision procedures for modal logics, in M. Pollack (ed.), Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), Vol. 1, Morgan Kaufmann, 1997, pp. 202-207.
14. Hustadt, U., Schmidt, R. A. and Weidenbach, C.: Optimised functional translation and resolution, in H. de Swart (ed.), Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'98), Lecture Notes in Comput. Sci. 1397, Springer, 1998, pp. 36-37.
15. Jónsson, B. and Tarski, A.: Boolean algebras with operators, Part I, Amer. J. Math. 73 (1951), 891-939.
16. Jónsson, B. and Tarski, A.: Boolean algebras with operators, Part II, Amer. J. Math. 74 (1952), 127-162.
17. Joyner, W. H., Jr.: Resolution strategies as decision procedures, J. ACM 23(3) (1976), 398-417.
18. Ladner, R. E.: The computational complexity of provability in systems of modal prepositional logic, SIAM J. Comput. 6(3) (1977), 467-480.
19. Ohlbach, H. J.: A Resolution Calculus for Modal Logics, Ph.D. Thesis, Univ. Kaiserslautern, Germany, 1988.
20. Ohlbach, H. J.: A resolution calculus for modal logics, in E. Lusk and R. Overbeek (eds), Automated Deduction: CADE-9, Lecture Notes in Comput. Sci. 310, Springer, 1988, pp. 500-516.
21. Ohlbach, H. J. : Semantics based translation methods for modal logics, J. Logic Comput. 1(5) (1991), 691-746.
22. Ohlbach, H. J. and Schmidt, R. A.: Functional translation and second-order frame properties of modal logics, J. Logic Comput. 7(5) (1997), 581-603.
23. Robinson, J. A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1) (1965), 23-41.
24. Schmidt, R. A.: Optimised Modal Translation and Resolution, Ph.D. Thesis, Universität des Saarlandes, Saarbrücken, Germany, 1997.
25. Schmidt, R. A.: E-unification for subsystems of S4, in T. Nipkow (ed.), Rewriting Techniques and Applications: 9th International Conference, RTA'98, Proceedings, Lecture Notes in Comput. Sci. 1379, Springer, 1998, pp. 106-120.
26. Schmidt, R. A.: Resolution is a decision procedure for many propositional modal logics, in M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev (eds), Advances in Modal Logic, Vol. 1, Lecture Notes 87, CSLI Publications, Stanford, 1998, pp. 189-208.
27. Schmidt-Schauß, M. and Smolka, G.: Attributive concept description with complements, Artif. Intell. 48: (1991), 1-26.
28. van Benthem, J.: Beyond accessibility: Functional models for modal logic, in M. De Rijke (ed.), Diamonds and Defaults, Kluwer, Dordrecht, 1993.
29. Zamov, N. K.: Modal resolutions, Soviet Math. 33(9) (1989), 22-29. Translated from Izv. Vyssh. Uchebn. Zaved. Mat. 9(328) (1989), 22-29.
30. Zamov, N. K.: Modal resolutions, Soviet Math. 33(9) (1989), 22-29. Translated from Izv. Vyssh. Uchebn. Zaved. Mat. 9(328) (1989), 22-29.