PSpace automata for description logics

CEUR Workshop Proceedings

Volumn 189, Issue , 2006, Pages 74-85

  Hladik, Jan ^a   Peñaloza, Rafael ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; DESCRIPTION LOGIC; SATISFIABILITY; SATISFIABILITY TESTING; TREE AUTOMATA;

DATA DESCRIPTION; FORMAL LANGUAGES; FORMAL LOGIC;

AUTOMATA THEORY;

EID: 84872955981     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. F. Baader, J. Hladik, C. Lutz, and F. Wolter. From tableaux to automata for description logics. Fundamenta Informaticae, 57:1-33, 2003.
2. F. Baader and W. Nutt. The Description Logic Handbook, chapter 2: Basic Description Logics. Cambridge University Press, 2003.
3. F. Baader and U. Sattler. An overview of tableau algorithms for description logics. Studia Logica, 69, 2001.
4. F. Baader and S. Tobies. The inverse method implements the automata approach for modal satisfiability. In R. Gore, A. Leitsch, and T. Nipkow, editors, Proceedings of IJCAR-01, volume 2083 of LNAI. Springer-Verlag, 2001.
5. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. Logic Journal of the IGPL, 8(3):239-264, 2000.
6. C. Lutz and U. Sattler. Mary likes all cats. In F. Baader and U. Sattler, editors, Proceedings of DL 2000, CEUR Proceedings, 2000.
7. C. Lutz. NExpTime-complete description logics with concrete domains. ACM Transactions on Computational Logic, 5(4):669-705, 2004.
8. G. Pan, U. Sattler, and M. Y. Vardi. BDD-based decision procedures for K. In Proceedings of the Conference on Automated Deduction, volume 2392 of Lecture Notes in Artificial Intelligence, 2002.
9. W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of computer and system sciences, 4(2):177-192, 1970.
10. K. Schild. Terminological cycles and the propositional μ-calculus. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proceedings of KR-94. Morgan Kaufmann, 1994.
11. E. Spaan. Complexity of Modal Logics. PhD thesis, University of Amsterdam, 1993.
12. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1):1-26, 1991.
13. A. Voronkov. How to optimize proof-search in modal logics: new methods of proving reduncancy criteria for sequent calculi. ACM transactions on computational logic, 2(2), 2001.
14. M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Science, 32:183-221, 1986.