Variants of first-order modal logics

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

Volumn 1847 LNAI, Issue , 2000, Pages 175-189

  Mayer, Marta Cialdea ^a   Cerrito, Serenella ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FIRST ORDER; FREE-VARIABLE TABLEAUX; MODAL LOGIC; NATURAL NUMBER; NON-RIGID; NONLOCAL; PROOF PROCEDURES; SEMANTICAL INFORMATION;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FORMAL LOGIC;

EID: 40849117558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722086_16     Document Type: Conference Paper

References (19)

1. M. Abadi and Z. Manna. Modal theorem proving. CADE-86, pages 172-189, 1986. Springer, LNCS 230.
2. A. Artosi, P. Benassi, G. Governatori, and A. Rotolo. Shakespearian modal logic: A labelled treatment of modal identity. Advances in Modal Logic, pages 1-21, 1998.
3. Y. Auffray and P. Enjalbert. Modal theorem proving: an equational viewpoint. J. of Logic and Computation, 2:247-297, 1992.
4. M. Baaz and C.G. Fermüller. Non-elementary speedups between different versions of tableaux. Tableaux '95, pages 217-230, 1995. Springer, LNCS 918.
5. D. Basin, M. Matthews, and L. Viganò. Labelled modal logics: Quantifiers. J. of Logic, Language and Information, 7(3):237-263, 1998.
6. B. Beckert, R. Hähnle, and P. H. Schmitt. The even more liberalized δ-rule in free variable semantic tableaux. In Proc. of the 3rd Kurt Gödel Colloquium KGC'93, pages 108-119, 1993. Springer, LNCS 713.
7. M. Cialdea. Resolution for some first order modal systems. Theoretical Computer Science, 85:213-229, 1991.
8. M. Cialdea and L. Fariñas del Cerro. A modal Herbrand's property. Z. Math. Logik Grundlag. Math., 32:523-539, 1986.
9. M. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel Publ. Co., 1983.
10. M. Fitting. First-order modal tableaux. J. of Automated Reasoning, 4:191-213, 1988.
11. M. Fitting. On quantified modal logic. Fundamenta Informaticae, 39:105-121,1999.
12. J. W. Garson. Quantification in modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, vol. II, 249-307. Reidel Publ. Co., 1984.
13. R. Goré. Tableau methods for modal and temporal logics. In M. D'Agostino, G. Gabbay, R. Hähnle, and J. Posegga, editors, Handbook of tableau methods. Kluwer, 1999.
14. R. Hähnle and P. H. Schmitt. The liberalized δ-rule in free variable semantic tableaux. J. of Automated Reasoning, 13:211-222, 1994.
15. P. Jackson and H. Reichgelt. A general proof method for first-order modal logic. IJCAI '87, pages 942-944. Morgan Kaufmann, 1987.
16. K. Konolige. Resolution and quantified epistemic logics. CADE 86, pages 199-208, 1986. Springer, LNCS 230.
17. G. Mints. Indexed systems of sequents and cut-elimination. J. of Philosophical Logic, 26:671-696, 1997.
18. H. J. Ohlbach. Semantics based translation methods for modal logics. J. of Logic and Computation, 1(5):691-746, 1991.
19. L. A. Wallen. Automated Deduction in Nonclassical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics. MIT Press, 1990.