A principle for incorporating axioms into the first-order translation of modal formulae

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

Volumn 2741, Issue , 2003, Pages 412-426

  Schmidt, Renate A ^a,b   Hustadt, Ullrich ^c  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED LANGUAGE TRANSLATION; FORMAL LOGIC; MODAL ANALYSIS; PROBLEM SOLVING;

BACKGROUND THEORY; FIRST ORDER; INFERENCE PROBLEM; MODAL LOGIC; NON-TRIVIAL; ORDERED RESOLUTION; THEOREM PROVERS; AXIOMATIC TRANSLATION; DECIDABLE LOGICS; EUCLIDEANNEES; FUNCTIONALITY; TRANSITIVITY;

AUTOMATION; THEOREM PROVING;

EID: 7044238419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_36     Document Type: Conference Paper

References (15)

1. G. De Giacomo. Eliminating “converse” from converse PDL. J. Logic, Language and Inform., 5(2):193-208, 1996.
2. H. De Nivelle, R. A. Schmidt, and U. Hustadt. Resolution-based methods for modal logics. Logic J. IGPL, 8(3):265-292, 2000.
3. S. Demri. The complexity of regularity in grammar logics and related modal logics. Journal of Logic and Computation, 11(6):933-960, 2001.
4. S. Demri and H. de Nivelle. Deciding regular grammar logics with converse through first-order logic. Manuscript, 2002.
5. S. Demri and R. Goré. Tractable transformations from modal provability logics into first-order logic. In Automated Deduction -CADE-16, vol. 1632 of LNAI, pp. 16-30. Springer, 1999.
6. D. M. Gabbay. Decidability results in non-classical logics. Ann. Math. Logic, 8:237-295, 1975.
7. H. Ganzinger, C. Meyer, and H. de Nivelle. The two-variable guarded fragment with transitive relations. In Proc. LICS, pp. 24-34. IEEE Computer Society, 1999.
8. U. Hustadt, C. Dixon, R. A. Schmidt, and M. Fisher. Normal forms and proofs in combined modal and temporal logics. In Proc. FroCoS’2000, vol. 1794 of LNAI, pp. 73-87. Springer, 2000.
9. U. Hustadt and R. A. Schmidt. On the relation of resolution and tableaux proof systems for description logics. In Proc. IJCAI’99, pp. 110-115. Morgan Kaufmann, 1999.
10. M. Kracht. Tools and Techniques in Modal Logic, vol. 142 of Studies in Logic. Elsevier, 1999.
11. M. Kracht. Reducing modal consequence relations. J. Logic Computat., 11(6):879-907, 2001.
12. M. Kracht. Notes on the space requirements for checking satisfiability in modal logics. To appear in Advances in Modal Logic, Vol. 4, 2002.
13. C. Lutz. Complexity of terminological reasoning revisited. In Proc. LPAR’99, vol. 1705 of LNAI, pp. 181-200. Springer, 1999.
14. H. J. Ohlbach. Combining Hilbert style and semantic reasoning in a resolution framework. In Automated Deduction -CADE-15, vol. 1421 of LNAI, pp. 205-219. Springer, 1998.
15. R. A. Schmidt and U. Hustadt. A principle for incorporating axioms into the firstorder translation of modal formulae. Preprint CSPP-22, Univ. Manchester, UK, 2003.