Answering regular path queries in expressive description logics: An automata-theoretic approach

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 391-396

  Calvanese, Diego ^a   Eiter, Thomas ^b   Ortiz, Magdalena ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; INFORMATION RETRIEVAL; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; REQUIREMENTS ENGINEERING;

COMPLEX QUERIES; DECIDABILITY FRONTIERS;

QUERY PROCESSING;

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

References (16)

1. Baader, F.; Calvanese, D.; McGuinness, D.; Nardi, D.; and Patel-Schneider, P. F., eds. 2003. The Description Logic Handbook: Theory, Implementation and Applications.
2. Calvanese, D.; De Giacomo, G.; Lenzerini, M.; and Vardi, M. Y. 2000. Containment of conjunctive regular path queries with inverse. In Proc. of KR 2000, 176-185.
3. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2006. Data complexity of query answering in description logics. In Proc. of KR 2006, 260-270.
4. Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proc. of PODS'98, 149-158.
5. Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 2002. 2ATAs make DLs easy. In Proc. of DL 2002, 107-118.
6. Glimm, B.; Horrocks, I.; Lutz, C.; and Sattler, U. 2007. Conjunctive query answering for the description logic SHXQ. In Proc. of IJCAI 2007, 399-404.
7. Heflin, J., and Hendler, J. 2001. A portrait of the Semantic Web in action. IEEE Intelligent Systems 16(2):54-59.
8. Hustadl, U.; Motik, B.; and Sattler, U. 2004. A decomposition rule for decision procedures by resolution-based calculi. In Proc. of LPAR 2004, 21-35.
9. Hustadt, U.; Motik, B.; and Sattler, U. 2005. Data complexity of reasoning in very expressive description logics. In Proc. of IJCAI 2005, 466-471.
10. Klarlund, N. 1994. Progress measures, immediate determinacy, and a subset construction for tree automata. Annals of Pure and Applied Logics 69(2-3):243-268.
11. Lutz, C. 2007. Inverse roles make conjunctive queries hard. In Proc. of DL 2007.
12. Ortiz., M. M.; Calvanese, D.; and Eiter, T. 2006. Data complexity of answering unions of conjunctive queries in SHTQ. In Proc. of DL 2006.
13. Schild, K. 1991. A correspondence theory for terminological logics: Preliminary report. In Proc. of/JCAI'91.
14. Tobies, S. 2001. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. Ph.D. Dissertation, LuFG Theoretical Computer Science, RWTH-Aachen, Germany.
15. van Emde Boas, P. 1997. The convenience of tilings. In Complexity, Logic, and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathematics. 331-363.
16. Vardi, M. Y. 1998. Reasoning about the past with two-way automata. In Proc. of ICALP'98, volume 1443 of LNCS, 628-641. Springer.