A road-map on complexity for hybrid logics

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

Volumn 1683, Issue , 1999, Pages 307-321

  Areces, Carlos ^a   Blackburn, Patrick ^b   Marx, Maarten ^a,c  

^a ILLC   (Netherlands)

^b SAARLAND UNIVERSITY   (Germany)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Computational complexity; Description logic; Labeled deduction; Modal and temporal logic

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA DESCRIPTION; FORMAL LANGUAGES; FORMAL LOGIC;

DESCRIPTION LOGIC; HYBRID LANGUAGES; K-SATISFIABILITY PROBLEMS; LABELED DEDUCTION; MODAL LANGUAGE; PSPACE-COMPLETE; TEMPORAL REASONING; UNDECIDABILITY;

COMPUTER CIRCUITS;

EID: 84956862612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_22     Document Type: Conference Paper

References (24)

1. C. Areces and M. de Rijke. Accounting for assertional information. Manuscript, 1999.
2. J. Allen. Towards a general theory of action and time. Artificial Intelligence, 23(2):123-154, July 1984.
3. J. van Benthem. The logic of time. Reidel, 1983.
4. J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Naples, 1983.
5. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer Verlag, 1997.
6. P. Blackburn. Internalizing labeled deduction. Technical Report CLAUS-Report 102, Computerlinguistik, Universität des Saarlandes, 1998. http://www.coli.uni-sb.de/cl/claus.
7. P. Blackburn and J. Seligman. Hybrid languages. J. of Logic, Language and Information, 4(3):251-272, 1995. Special issue on decompositions of first- order logic.
8. P. Blackburn and J. Seligman. What are hybrid languages? In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic, volume 1, pages 41-62. CSLI Publications, Stanford University, 1998.
9. P. Blackburn and M. Tzakova. Hybrid languages and temporal logics. Logic J. of the IGPL, 7(1):27-54, 1999.
10. R. Bull. An approach to tense logic. Theoria, 36:282-300, 1970.
11. B. Chlebus. Domino-tiling games. J. Comput. System Sci., 32(3):374-392, 1986.
12. D. Gabbay. Labeled deductive systems. Oxford University Press, 1996.
13. V. Goranko. Hierarchies of modal and temporal logics with reference pointers. J. Logic Lang. Inform., 5(1):1-24, 1996.
14. E. Grädel. On the restraining power of guards. To appear in J. of Symbolic Logic, 1997.
15. J. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
16. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM J. of Computing, 6(3):467-480, 1977.
17. S. Passy and T. Tinchev. Quantifiers in combinatory PDL: completeness, definability, incompleteness. In Fundamentals of computation theory (Cottbus, 1985), pages 512-519. Springer, Berlin, 1985.
18. K. Schild. A correspondence theory for terminological logics. In Proc. of the 12th IJCAI, pages 466-471, 1991.
19. A. Schaerf. Query Answering in Concept-Based Knowledge Representation Systems: Algorithms, Complexity, and Semantic Issues. PhD thesis, Diparti- mento di Informatica e Sistemistica, Univ. di Roma “La Sapienza”, 1994.
20. J. Seligman. The logic of correct description. In M. de Rijke, editor, Advances in Intensional Logic, pages 107-135. Kluwer, 1997.
21. E. Spaan. Complexity of modal logics. PhD thesis, ILLC. University of Amsterdam, 1993.
22. E. Spaan. The complexity of propositional tense logics. In Diamonds and defaults (Amsterdam, 1990/1991), pages 287-307. Kluwer Acad. Publ., Dordrecht, 1993.
23. M. Schmidt-Schauss and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48:1-26, 1991.
24. M. Tzakova. Tableaux calculi for hybrid logics. Manuscript, 1998.