Unions of conjunctive queries in SHOQ

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2008, Pages 252-262

  Glimm, Birte ^a   Horrocks, Ian ^a   Sattler, Ulrike ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; FORMAL LANGUAGES; KNOWLEDGE BASED SYSTEMS; QUERY LANGUAGES;

CONJUNCTIVE QUERIES; DECISION PROCEDURE; DESCRIPTION LOGIC; DOUBLE EXPONENTIAL; EXPRESSIVE DESCRIPTION LOGIC; EXPTIME; KNOWLEDGE BASE;

KNOWLEDGE REPRESENTATION;

EID: 84860513100     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Baader, F.; Calvanese, D.; McGuinness, D. L.; Nardi, D.; and Patel-Schneider, P. F., eds. 2003. The Description Logic Handbook. Cambridge University Press.
2. Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proc. of the Seventeenth ACM SIGACT SIGMOD Sym. on Principles of Database Systems (PODS-98). ACMPress and AddisonWesley.
3. Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 2002. 2ATAs make DLs easy. In Proc. of the 2002 Description Logic Workshop (DL 2002), volume 53. CEUR.
4. Calvanese, D.; Eiter, T.; and Ortiz, M. 2007. Answering regular path queries in expressive description logics: An automata-theoretic approach. In Proc. of the Nat. Conf. on Artificial Intelligence (AAAI-07).
5. Glimm, B.; Horrocks, I.; Lutz, C.; and Sattler, U. 2007. Conjunctive query answering in the description logic SHIQ. In Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI-07).
6. Glimm, B.; Horrocks, I.; Lutz, C.; and Sattler, U. 2008. Conjunctive query answering for the description logic SHIQ. J. of Artificial Intelligence Research 31:151-198.
7. Glimm, B. 2007. Querying Description Logic Knowledge Bases. Ph.D. Dissertation, The University of Manchester, Manchester, United Kingdom. http://www.cs.man.ac.uk/̃glimmbx/download/Glim07a.pdf.
8. Horrocks, I.; Sattler, U.; Tessaris, S.; and Tobies, S. 2000. How to decide query containment under constraints using a description logic. In Proc. of the 7th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR 2000), Lecture Notes in Artificial Intelligence. Springer.
9. Horrocks, I.; Patel-Schneider, P. F.; and van Harmelen, F. 2003. From SHIQ and RDF to OWL: The making of a web ontology language. John Wiley & Sons 1(1):7-26.
10. Kazakov, Y., and Motik, B. 2006. A resolution-based decision procedure for SHOIQ. In Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR-06), volume 4130, 662-667. Springer.
11. Lutz, C. 2007. Inverse roles make conjunctive queries hard. In Proc. of the 2007 Description Logic Workshop (DL 2007).
12. Muller, D. E., and Schupp, P. E. 1987. Alternating automata on infinite trees. Theoretical Computer Science 54(2-3):267-276.
13. Sattler, U., and Vardi, M. Y. 2001. The hybrid μ-calculus. In Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR-01). Springer.
14. Tessaris, S. 2001. Questions and answers: reasoning and querying in Description Logic. PhD thesis, University of Manchester.
15. Tobies, S. 2001. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen.
16. Vardi, M. Y. 1995. Alternating automata and program verification. In Computer Science Today, volume 1000 of Lecture Notes in Computer Science. Springer.