Complexity of simple dependent bimodal logics

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

Volumn 1847 LNAI, Issue , 2000, Pages 190-204

  Demri, Stéphane ^a  

^a Laboratoire LEIBNIZ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIMODAL LOGIC; GUARDED FRAGMENT; MODAL LOGIC; MULTI-MODAL LOGIC; SATISFIABILITY PROBLEMS; UNIFORM FRAMEWORK; UPPER BOUND; EXPTIME;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FORMAL LOGIC;

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

References (36)

1. M. Baldoni. Normal Multimodal Logics: Automated Deduction and Logic Programming. PhD thesis, Università degli Studi di Torino, 1998.
2. B. Beckert and D. Gabbay. Fibring semantic tableaux. In H. de Swart, editor, TABLEAUX-8, pages 77-92. LNAI, Springer-Verlag, 1998.
3. J. van Benthem. Modal logic and classical logic. Bibliopolis, 1985.
4. J. van Benthem. Modal logic in two Gestalts. Technical report, ILLC, 1998.
5. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. 2000. to appear.
6. M. Castilho, O. Gasquet, and A. Herzig. Formalizing action and change in modal logic I: the frame problem. J. of Logic and Computation, 1998. to appear.
7. M. Castilho and A. Herzig. An alternative to the iteration operator of propositional dynamic logic. Technical Report 96-05-R, IRIT, 1996.
8. 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.
9. A. Chagrov and M. Zakharyaschev. Modal Logic. Clarendon Press, Oxford, 1997.
10. C. Chen and I. Lin. The complexity of propositional modal theories and the complexity of consistency of propositional modal theories. In A. Nerode and Yu. V. Matiyasevich, editors, LFCS-3, St. Petersburg, pages 69-80. Springer-Verlag, LNCS 813, 1994.
11. S. Demri. A class of decidable information logics. TCS, 195(1):33-60, 1998.
12. K. Fine and G. Schurz. Transfer theorems for multimodal logics. In Logic and Reality. Essays in Pure and Applied Logic. In Memory of Arthur Prior. OUP, 1992. To appear.
13. M. Fitting. Proof methods for modal and intuitionistic logics. D. Reidel Publishing Co., 1983.
14. M. Fitting. First-order modal tableaux. JAR, 4:191-213, 1988.
15. D. Gabbay. Fibred semantics and the weaving of logics Part 1: modal and intuitionistic logics. The Journal of Symbolic Logic, 61(4):1057-1120, 1996.
16. D. Gabbay and V. Shehtman. Products of modal logics, Part I. Logic Journal of the IGPL, 6(1):73-146, 1998.
17. 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, pages 297-396. Kluwer, 1999.
18. J. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
19. E. Hemaspaandra. Complexity transfer for modal logic (extended abstract). In LICS-9, pages 164-173, 1994.
20. A. Heuerding. Sequent Calculi for Proof Search in Some Modal Logics. PhD thesis, University of Bern, 1998.
21. M. Kracht and F.Wolter. Simulation and transfer results in modal logic - A survey. Studia Logica, 59:149-1997, 1997.
22. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467-480, 1977.
23. M. Marx. Complexity of modal logics of relations. Technical report, ILLC, 1997. To appear in Annals of Pure and Applied Logic.
24. M. Marx. Complexity of products of modal logics. Journal of Logic and Computation, 9(2):197-214, 1999.
25. M. Marx, S. Mikulás, and S. Schlobach. Tableau calculus for local cubic modal logic and its implementation. Logic Journal of the IGPL, 7(6):755-778, 1999.
26. F. Massacci. Single steps tableaux for modal logics. JAR, 1999. to appear.
27. Ch. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
28. V. Pratt. Models of program logics. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pages 115-122, 1979.
29. A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. JACM, 32(3):733-749, 1985.
30. E. Spaan. Complexity of Modal Logics. PhD thesis, ILLC, 1993.
31. E. Spaan. The complexity of propositional tense logics. In M. de Rijke, editor, Diamonds and Defaults, pages 287-309. Kluwer, 1993.
32. M. Tiomkin and M. Kaminsky. Nonmonotonic default modal logics. JACM, 38:963-984, 1991.
33. D. Vakarelov. Modal characterization of the classes of finite and infinite quasiordered sets. In P. Petkov, editor, Mathematical Logic, pages 373-387. Plenum Press, New-York, 1990.
34. D. Vakarelov. Modal logics for knowledge representation systems. TCS, 90:433-456, 1991.
35. L. Viganò. Labelled Non-Classical Logics. Kluwer, 2000.
36. A. Visser. A course on bimodal provability logic. Annals of Pure and Applied Logic, 73:109-142, 1995.