An O((n · log n)3)-time transformation from Grz into decidable fragments of classical first-order logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1761 LNAI, Issue , 2000, Pages 152-166

  Demri, Stéphane ^a   Goré, Rajeev ^b  

^a Laboratoire LEIBNIZ CNRS   (France)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTABILITY AND DECIDABILITY; EMBEDDINGS; MACHINERY; THEOREM PROVING; TURING MACHINES;

FIRST ORDER; FIRST ORDER LOGIC; FIRST PRINCIPLES; GUARDED FRAGMENT; PROVABILITY LOGIC; SECOND ORDERS;

COMPUTER CIRCUITS;

EID: 84867837209     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46508-1_10     Document Type: Conference Paper

References (38)

1. M. Abadi and Z. Manna. Modal theorem proving. In J. H. Siekmann, editor, CADE-8, pages 172-189. Springer Verlag, LNCS 230, 1986.
2. H. Andreka, I. Nemeti, and J. van Benthem. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217-274, 1998.
3. A. Avron. On modal systems having arithmetical interpretations. The Journal of Symbolic Logic, 49(3):935-942, 1984.
4. N. Belnap. Display logic. Journal of Philosophical Logic, 11:375-417, 1982.
5. J. van Benthem. Modal logic and classical logic. Bibliopolis, 1983.
6. J. van Benthem. The Range of Modal Logic - An Essay in Memory of George Gargov. Journal of Applied Non-Classical Logics, 1999. To appear.
7. Ph. Balbiani and A. Herzig. A translation from the modal logic of provability into K4. Journal of Applied Non-Classical Logics, 4:73-77, 1994.
8. G. Boolos. The Logic of Provability. Cambridge University Press, 1993.
9. S. Cerrito and M. Cialdea Mayer. A polynomial translation of S4 into T and contraction-free tableaux for S4. Logic Journal of the IGPL, 5(2):287-300, 1997.
10. A. Chagrov and M. Zakharyaschev. Modal Logic. Clarendon Press, Oxford, 1997.
11. 3)-time transformation from Grz into decidable fragments of classical first-order logic. In 2nd International Workshop on First-Order Theorem Proving, Vienna, pages 127-134. TU-Wien Technical Report E1852-GS-981, 1998.
12. S. Demri and R. Goré. Theoremhood preserving maps as a characterisation of cut elimination for provability logics. Technical Report, A.R.P., A.N.U., 1999. Forthcoming.
13. G. d'Agostino, A. Montanari, and A. Policriti. A set-theoretical translation method for polymodal logics. Journal of Automated Reasoning, 15:317-337, 1995.
14. M. Fitting. Proof methods for modal and intuitionistic logics. D. Reidel Publishing Co., 1983.
15. M. Fitting. First-order modal tableaux. Journal of Automated Reasoning, 4:191-213, 1988.
16. M. Fürer. The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In Logical machines: Decision problems and complexity, pages 312-319. LNCS 171, Springer-Verlag, 1981.
17. R. Goré, W. Heinle, and A. Heuerding. Relations between propositional normal modal logics: an overview. Journal of Logic and Computation, 7(5):649-658, 1997.
18. H. Ganzinger, U. Hustadt, C. Meyer, and R. Schmidt. A resolution-based decision procedure for extensions of K4. In 2nd Workshop on Advances in Modal Logic (AiML'98), Uppsala, Sweden, 1998. to appear.
19. R. Goré. Cut-free sequent and tableau systems for propositional Diodorian modal logics. Studia Logica, 53:433-457, 1994.
20. R Goré. Tableaux methods for modal and temporal logics. In M. d'Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors, Handbook of Tableaux Methods. Kluwer, Dordrecht, 1999. To appear.
21. A. Herzig. Raisonnement automatique en logique modale et algorithmes d'unification. PhD thesis, Université P. Sabatier, Toulouse, 1989.
22. J. Hudelmaier. Improved decision procedures for the modal logics K, T and S4. In H. Buning, editor, Computer Science Logic (CSL'95), pages 320-334. LNCS 1092, Springer-Verlag, 1996.
23. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467-480, 1977.
24. H. Lewis. Complexity results for classes of quantificational formulas. Journal of Computer and System Sciences, 21:317-353, 1980.
25. G. Mints. Gentzen-type and resolution rules part I: propositional logic. In P. Martin-Löf and G. Mints, editors, International Conference on Computer Logic, Tallinn, pages 198-231. Springer Verlag, LNCS 417, 1988.
26. M. Mortimer. On language with two variables. Zeitschrift für Mathematik Logik und Grundlagen der Mathematik, 21:135-140, 1975.
27. Ch. Morgan. Methods for automated theorem proving in non classical logics. IEEE Transactions on Computers, 25(8):852-862, 1976.
28. H. de Nivelle. A resolution decision procedure for the guarded fragment. In C. Kirchner and H. Kirchner, editors, CADE-15, Lindau, Germany, pages 191-204. LNAI 1421, Springer-Verlag, 1998.
29. A. Nonnengart. Resolution-based calculi for modal and temporal logics. In M. McRobbie and J. Slaney, editors, CADE-13, pages 599-612. LNAI 1104, Springer-Verlag, 1996.
30. H.J. Ohlbach. A resolution calculus for modal logics. PhD thesis, FB Informatik Univ. of Kaiserslautern, 1988.
31. H.J. Ohlbach. Optimized translation of multi modal logic into predicate logic. In A. Voronkov, editor, LPAR'93, pages 253-264. Springer-Verlag, LNAI 698, 1993.
32. H. J. Ohlbach. Combining Hilbert style and semantic reasoning in a resolution framework. In C. Kirchner and H. Kirchner, editors, CADE-15, Lindau, Germany, pages 205-219. LNAI 1421, Springer-Verlag, 1998.
33. M. Ohnishi and K. Matsumoto. Gentzen method in modal calculi. Osaka Mathematical Journal, 9:113-130, 1957.
34. Ch. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
35. W. Rautenberg. Modal tableau calculi and interpolation. The Journal of Philosophical Logic, 12:403-423, 1983.
36. R. Schmidt. Optimised Modal Translation and Resolution. PhD thesis, Fakult ät der Universität des Saarlandes, 1997.
37. R. Solovay. Provability interpretations of modal logics. Israel Journal of Mathematics, 25:287-304, 1976.
38. M. Vardi. Why is modal logic so robustly decidable? In Descriptive complexity and finite models, A.M.S., 1997.