A tableau algorithm for description logics with concrete domains and GCIs

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

Volumn 3702 LNAI, Issue , 2005, Pages 201-216

  Lutz, Carsten ^a   Miličić, Maja ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; KNOWLEDGE ACQUISITION;

CONCRETE DOMAINS; DESCRIPTION LOGICS (DL); TABLEAU ALGORITHM;

FORMAL LOGIC;

EID: 33646196860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554554_16     Document Type: Conference Paper

References (22)

1. J. Allen. Maintaining knowledge about, temporal intervals. Communications of the ACM, 26(11), 1983.
2. F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In Proc. of IJCAI-91, pages 452-457, Morgan Kaufman. 1991.
3. F. Baader, I. Horrocks, and U. Sattler. Description logics as ontology languages for the semantic web. In Festschrift in honor of Jörg Siekmann, LNAI. Springer-Verlag, 2003.
4. F. Baader, D. L. McGuiness, D. Nardi, and P. Patel-Schneider. The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press, 2003.
5. P. Balbiani and J.-F. Condotta. Computational complexity of prepositional linear temporal logics based on qualitative spatial or temporal reasoning. In Proc. of FroCoS 2002, number 2309 in LNAI, pages 162-176. Springer, 2002.
6. B. Bennett. Modal logics for qualitative spatial reasoning. Journal of the IGPL, 4(1), 1997.
7. D. Calvanese. Reasoning with inclusion axioms in description logics: Algorithms and complexity. In Proc. of ECAI-96, pages 303-307, 1996.
8. D. Calvanese, M. Lenzerini, and D. Nardi. Description logics for conceptual data modeling. In Logics for Databasts and Information Systems, pages 229-263. Kluwer, 1998.
9. D. M. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications. Elsevier, 2003.
10. V. Haarslev and R. Möller. RACER system description. In Proc. of UCAR'01, number 2083 in LNAI, pages 701-705. Springer-Verlag, 2001.
11. I. Horrocks, Using an expressive description logic: Fact or fiction? In Proc. of KR98, pages 636-647, 1998.
12. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for expressive description logics. In Proc. of LPAR'99, number 1705 in LNAI, pages 161-180, Springer, 1999.
13. C. Lutz, Complexity of terminological reasoning revisited. In Proc. of LPAR'09, number 1705 in LNAI, pages 181-200. Springer, 1999.
14. C. Lutz, Adding numbers to the SHIQ description logic-First results, In Proc. of KR2002, pages 191-202. Morgan Kaufman, 2002.
15. C. Lutz, Reasoning about, entity relationship diagrams with complex attribute dependencies. In Proc. of DL2002, number 53 in CEUR-WS (http://ceur-ws.org/), pages 185-194, 2002.
16. C. Lutz. Description logics with concrete domains - a survey. In Advances in Modal Logics Volume 4, pages 265-296, King's College Publications, 2003.
17. C. Lutz. Combining interval-based temporal reasoning with general tboxes, Artificial Intelligence, 152(2):235-274, 2004,
18. C. Lutz. NExpTime-complete description logics with concrete domains. ACM Transactions on Computational Logic, 5(4):669-705, 2004.
19. C. Lutz and M. Miličić. A tableau algorithm for DLs with concrete domains and GCIs. LTCS-Report 05-07, TU Dresden, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
20. D. A. Randell, Z. Cui, and A. G. Cohn. A spatial logic based on regions and connection. In Proc. of KR'92, pages 165-176. Morgan Kaufman, 1992.
21. J. Renz and B. Nebel. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus. Artificial Intelligence, 108(1-2):69-123, 1999.
22. M. Vilain, H. Kautz, and P. van Beek. Constraint propagation algorithms for temporal reasoning: a revised report. In Readings in qualitative reasoning about physical systems, pages 373-381. Morgan Kaufmann, 1990.