The complexity of finite model reasoning in description logics

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

Volumn 2741, Issue , 2003, Pages 60-74

  Lutz, Carsten ^a   Sattler, Ulrike ^a   Tendera, Lidia ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF OPOLE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL LANGUAGES; THEOREM PROVING; FINITE AUTOMATA; FORMAL LOGIC; MATHEMATICAL MODELS;

DESCRIPTION LOGIC; EXPTIME; FINITE MODEL REASONING; NUMBER RESTRICTIONS; REASONING TASKS; SATISFIABILITY; STANDARD REASONING;

DATA DESCRIPTION; COMPUTATIONAL COMPLEXITY;

DESCRIPTION LOGICS; FINITE MODEL; GENERAL TBOXES; NUMBER RESTRICTIONS;

EID: 7044227454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_6     Document Type: Conference Paper

References (15)

1. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2002.
2. M. Bojanczyk. Two-way alternating automata and finite models. In Proc. of ICALP2002, vol. 2380 of LNCS. Springer-Verlag, 2002.
3. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. of PODS-98. ACM Press, 1998.
4. D. Calvanese, M. Lenzerini, and D. Nardi. Description logics for conceptual data modeling. In Logics for Databases and Information Systems. Kluwer Academic Publisher, 1998.
5. D. Calvanese. Finite model reasoning in description logics. In Proc. of KR-96. Morgan Kaufmann, 1996.
6. G. De Giacomo and M. Lenzerini. Tbox and Abox reasoning in expressive description logics. In Proc. of KR-96. Morgan Kaufmann, 1996.
7. M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. J. of Computer and System Science, 18:194-211, 1979.
8. E. Franconi and G. Ng. The i. com tool for intelligent conceptual modelling. In Working Notes of the ECAI2000 Workshop KRDB2000. CEUR, 2000.
9. I. Horrocks, U. Sattler, S. Tessaris, and S. Tobies. How to decide query containment under constraints using a description logic. In Proc. of LPAR 2000, vol. 1955 in LNAI. Springer-Verlag, 2000.
10. C. Lutz, U. Sattler, and L. Tendera. The complexity of finite model reasoning in description logics. LTCS-Report 02-05, TU Dresden, 2002. Available from http://lat.inf.tu-dresden.de/research/reports.html.
11. K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91. Morgan Kaufmann, 1991.
12. M. Schmidt-Schaus and G. Smolka. Attributive Concept Descriptions with Complements. Artificial Intelligence, 48(1), 1991.
13. B. Thalheim. Fundamentals of cardinality constraints. In Proc. of ER’92, vol. 645 in LNCS. Springer Verlag, 1992.
14. S. Tobies. The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. of Art. Intelligence Research, 12:199-217, 2000.
15. M. Y.Vardi. Reasoning about the past with two-way automata. In Proc. of ICALP’98, vol. 1443 of LNCS. Springer-Verlag, 1998.