Data complexity in the εℒ family of description logics

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

Volumn 4790 LNAI, Issue , 2007, Pages 333-347

  Krisnadhi, Adila ^a   Lutz, Carsten ^b  

^a UNIVERSITY OF INDONESIA   (Indonesia)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DESCRIPTION LOGICS; QUERY ANSWERING; TRACTABILITY;

COMPUTATIONAL COMPLEXITY; GLOBAL OPTIMIZATION; INVERSE PROBLEMS; QUERY LANGUAGES;

MODEL CHECKING;

EID: 38349006924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: DL-Lite in the light of first-order logic. In: AAAI 2007. Proc. of the 22nd Conf. on AI, AAAI Press, Stanford, California, USA (2007)
2. Baader, F., Brandt, S., Lutz, C.: Pushing the ε ℒ envelope. In: IJCAI 2005. Proc. of the 19th Int. Joint Conf. on AI, pp. 364-369. Morgan Kaufmann, San Francisco (2005)
3. Baader, F., Brandt, S., Lutz, C.: Pushing the ε ℒ envelope. (submitted to a Journal, 2007)
4. Baader, F., Lutz, C., Suntisrivaraporn, B.: Is tractable reasoning in extensions of the description logic ε ℒ useful in practice? In: M4M 2005. Proc. of the 4th Int. WS on Methods for Modalities (2005)
5. Baader, F., McGuiness, D.L., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press, Cambridge (2003)
6. Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: ECAI 2004. Proc. of the 16th European Conf. on AI, pp. 298-302. IOS Press, Amsterdam (2004)
7. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: DL-lite: Tractable description logics for ontologies. In: AAAI 2005. Proc. of the 20th National Conf. on AI, pp. 602-607. AAAI Press, Stanford, California, USA (2005)
8. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: KR 2006. Proc. of the 10th Int. Conf. on KR, AAAI Press, Stanford, California, USA (2006)
9. Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R., Vetere, G.: DL-lite: Practical reasoning for rich dis. In: DL 2004. CEUR Workshop Proceedings. CEUR-WS.org, vol. 104 (2004)
10. Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive Query Answering for the Description Logic SHIQ. In: IJCAI 2007. Proc. of the 20th Int. Joint Conf. on AI, AAAI Press, Stanford, California, USA (2007)
11. Giacomo, G.D., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: AAAI 1994. Proc. of the 12th National Conf. on AI, vol. 1, pp. 205-212. AAAI Press, Stanford, California, USA (1994)
12. Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: IJCAI 2005. Proc. of the 19th Int. Joint Conf. on AI, Professional Book Center, pp. 466-471 (2005)
13. Kazakov, Y.: Saturation-based decision procedures for extensions of the guarded fragment, PhD thesis, University of Saarland (2005)
14. Krisnadhi, A.: Data complexity of instance checking in the ε ℒ family of description logics. Master thesis, TU Dresden, Germany (2007)
15. Krisnadhi, A., Lutz, C.: Data complexity of instance checking in the ε ℒ family of description logics. available from http://lat.inf.tu- dresden.de/~clu/papers/
16. Krötzsch, M., Rudolph, S., Hitzler, P.: On the complexity of horn description logics. In: Proc. of the 2nd WS on OWL: Experiences and Directions. CEUR-WS, vol. 216 (2006), http://ceur-ws.org/
17. Krötzsch, M., Rudolph, S.: Conjunctive Queries for ε ℒ with Composition of Roles. In: DL 2007. Proc. of the 2007 Int. WS on DLs, CEUR-WS.org (2007)
18. Rosati, R.: On conjunctive query answering in ε ℒ. In: DL 2007. Proc. of the 2007 Int. WS on DLs, CEUR-WS.org (2007)
19. Schaerf, A.: On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems 2, 265-278 (1993)