Data complexity in the εL family of DLs

CEUR Workshop Proceedings

Volumn 250, Issue , 2007, Pages 88-99

  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

CONJUNCTIVE QUERIES; DATA COMPLEXITY; DESCRIPTION LOGIC; UPPER BOUND;

FORMAL LANGUAGES;

DATA DESCRIPTION;

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

References (17)

1. F. Baader, S. Brandt, and C. Lutz. Pushing the EL envelope. In Proc. of the 19th Int. Joint Conf. on AI (IJCAI-05), pages 364.369. Morgan Kaufmann, 2005.
2. F. Baader, S. Brandt, and C. Lutz. Pushing the EL envelope. Submitted to a Journal. 2007.
3. F. Baader, C. Lutz, and B. Suntisrivaraporn. Is tractable reasoning in extensions of the description logic EL useful in practice? In Proc. of the 4th Int. WS on Methods for Modalities (M4M'05), 2005.
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. S. Brandt. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and.what else? In Proc. of the 16th European Conf. on AI (ECAI-2004), pages 298-302. IOS Press, 2004.
6. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. DL-lite: Tractable description logics for ontologies. In Proc. of the 20th National Conf. on AI (AAAI'05), pages 602-607. AAAI Press, 2005.
7. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In Proc. of the 10th Int. Conf. on KR (KR'06). AAAI Press, 2006.
8. D. Calvanese, G. D. Giacomo, M. Lenzerini, R. Rosati, and G. Vetere. DL-lite: Practical reasoning for rich dls. In Proc. of the 2004 Int. WS on DLs (DL2004), volume 104 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
9. B. Glimm and I. Horrocks and C. Lutz and U. Sattler. Conjunctive Query Answering for the Description Logic SHIQ. In {em Proc. of the 20th Int. Joint Conf. on AI (IJCAI-07). AAAI Press, 2007.
10. G. D. Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proc. of the 12th National Conf. on AI (AAAI'94). Volume 1, pages 205-212. AAAI Press, 1994.
11. U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In Proc. of the 19th Int. Joint Conf. on AI (IJCAI'05), pages 466-471. Professional Book Center, 2005.
12. A. Krisnadhi. Data complexity of instance checking in the EL family of description logics. Master thesis, TU Dresden, Germany, 2007.
13. A. Krisnadhi and C. Lutz Data complexity of instance checking in the EL family of description logics. Available from http://lat.inf.tu-dresden.de/clu/ papers/.
14. M. Krötzsch, S. Rudolf, and P. Hitzler. On the complexity of horn description logics. In Proc. of the 2nd WS on OWL: Experiences and Directions, number 216 in CEUR-WS (http://ceurws.org/), 2006.
15. M. Krötzsch and S. Rudolf. Conjunctive Queries for EL with Composition of Roles. In Proc. of the 2007 Int. WS on DLs (DL2007). CEUR-WS.org, 2007.
16. R. Rosati. On conjunctive query answering in EL. In Proc. of the 2007 Int. WS on DLs (DL2007). CEUR-WS.org, 2007.
17. A. Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems, 2:265-278, 1993.