Automata can show PSpace results for description logics

Information and Computation

Volumn 206, Issue 9-10, 2008, Pages 1045-1056

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

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Automata theory; Complexity; Description logics; PSpace

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CHLORINE COMPOUNDS; COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; EMBEDDED SYSTEMS; INFERENCE ENGINES; RECURSIVE FUNCTIONS; ROBOTS; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

COMPLEXITY; COMPLEXITY RESULTS; DESCRIPTION LOGIC; DESCRIPTION LOGICS; INFERENCE PROBLEMS; ON-THE-FLY; OPTIMAL ALGORITHMS; PSPACE; SATISFIABILITY;

AUTOMATA THEORY;

EID: 50149098820     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.03.006     Document Type: Article

References (19)

1. In: Baader F., Calvanese D., McGuinness D., Nardi D., and Patel-Schneider P.F. (Eds). The Description Logic Handbook: Theory, Implementation, and Applications. 2nd ed. (2007), Cambridge University Press
2. Schild K. A correspondence theory for terminological logics: Preliminary report. In: Mylopoulos J., and Reiter R. (Eds). Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI-91) (1991), Morgan Kaufmann, Los Altos
3. Fitting M. Proof Methods for Modal and Intuitionistic Logics (1983), Reidel
4. Baader F., and Sattler U. An overview of tableau algorithms for description logics. Studia Logica 69 (2001) 5-40 An abridged version appeared in Tableaux 2000, volume 1847 of LNAI, 2000. Springer-Verlag
5. Vardi M.Y., and Wolper P. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science 32 (1986) 183-221
6. Calvanese D., De Giacomo G., and Lenzerini M. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: Dean T. (Ed). Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI-99) (1999), Morgan Kaufmann, Los Altos
7. Schmidt-Schauß M., and Smolka G. Attributive concept descriptions with complements. Artificial Intelligence 48 1 (1991) 1-26
8. J. Hladik, R. Peñaloza, PSPACE automata for description logics, in: B. Parsia, U. Sattler, D. Toman (Eds.), Proc. of the 2006 Description Logic Workshop (DL 2006), Vol. 189 of CEUR Proceedings, 2006, available from ceur-ws.org.
9. Baader F., Bürckert H.-J., Hollunder B., Nutt W., and Siekmann J.H. Concept logics. In: Lloyd J.W. (Ed). Computational Logics, Symposium Proceedings (1990), Springer-Verlag 177-201
10. Horrocks I., and Patel-Schneider P.F. Optimizing description logic subsumption. Journal of Logic and Computation 9 3 (1999) 267-293
11. Baader F., and Tobies S. The inverse method implements the automata approach for modal satisfiability. In: Goré R., Leitsch A., and Nipkow T. (Eds). Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR-01). Vol. 2083 of Lecture Notes in Artificial Intelligence (2001), Springer-Verlag
12. Voronkov A. 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) 182-215
13. Baader F., Hladik J., Lutz C., and Wolter F. From tableaux to automata for description logics. Fundamenta Informaticae 57 (2003) 1-33
14. Sattler U. A concept language extended with different kinds of transitive roles. In: Görz G., and Hölldobler S. (Eds). Proc. of the 20th German Annual Conf. on Artificial Intelligence (KI'96). No. 1137 in Lecture Notes in Artificial Intelligence (1996), Springer-Verlag
15. Nebel B. Terminological reasoning is inherently intractable. Artificial Intelligence 43 (1990) 235-249
16. Lutz C. Complexity of terminological reasoning revisited. Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'99). Vol. 1705 of Lecture Notes in Artificial Intelligence (1999), Springer-Verlag 181-200
17. Blackburn P., de Rijke M., and Venema Y. Modal Logic. Cambridge Tracts in Theoretical Computer Science Vol. 53 (2001), Cambridge University Press
18. R+-satisfiability, LTCS-Report 98-08, LuFg Theoretical Computer Science, RWTH Aachen, Germany (1998).
19. Savitch W.J. Relationship between nondeterministic and deterministic tape complexities. Journal of Computer and System Science 4 (1970) 177-192