Status QIO: Conjunctive query entailment is decidable

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2010, Pages 225-235

  Glimm, Birte ^a   Rudolph, Sebastian ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIRDS; COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; INVERSE PROBLEMS; QUERY LANGUAGES;

CONJUNCTIVE QUERIES; CONJUNCTIVE QUERIES (CQS); DECISION PROCEDURE; DESCRIPTION LOGIC; KNOWLEDGE REPRESENTATION FORMALISM; NUMBER RESTRICTIONS; STANDARD QUERY LANGUAGES; UNSOLVABLE PROBLEMS;

KNOWLEDGE REPRESENTATION;

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

References (28)

1. Baader, F.; Calvanese, D.; McGuinness, D. L.; Nardi, D.; and Patel-Schneider, P. F. 2003. The Description Logic Handbook. Cambridge University Press.
2. Baader, F.; Brandt, S.; and Lutz, C. 2005. Pushing the EL envelope. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI-05). Morgan Kaufmann.
3. Baader, F. 2003. Terminological cycles in a description logic with existential restrictions. In Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI-03), 325-330.
4. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3):385-429.
5. Calvanese, D.; De Giacomo, G.; and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proc. of the 17th ACMSIGACT SIGMODSym. on Principles of Database Systems (PODS-98), 149-158. ACM Press and AddisonWesley.
6. 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).
7. Eiter, T.; Lutz, C.; Ortiz, M.; and Simkus, M. 2009. Query answering in description logics with transitive roles. In Proc. of IJCAI-09, 759-764. AAAI Press/The MIT Press.
8. Glimm, B., and Rudolph, S. 2009. Nominals, inverses, counting, and conjunctive queries or Why infinity is your friend! Technical report, University of Oxford. http://www.comlab.ox.ac.uk/files/2175/paper.pdf.
9. 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.
10. Glimm, B.; Horrocks, I.; and Sattler, U. 2008. Unions of conjunctive queries in SHOQ. In Proc. of KR-08. AAAI Press/The MIT Press.
11. Gödel, K. 1929. Über die Vollständigkeit des Logikkalkü ls. Ph.D. Dissertation, Universiẗat Wien.
12. Grahne, G. 1991. Problem of Incomplete Information in Relational Databases. LNCS. Springer.
13. Horrocks, I., and Sattler, U. 2005. A tableaux decision procedure for SHOIQ. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI-05).
14. Kazakov, Y., and Motik, B. 2008. A resolution-based decision procedure for SHOIQ. J. of Automated Reasoning 40(2-3):89-116.
15. Krötzsch, M.; Rudolph, S.; and Hitzler, P. 2007. Conjunctive queries for a tractable fragment of OWL 1.1. In Proc. of the Int. Semantic Web Conf. (ISWC-07), volume 4825 of LNCS, 310-323. Springer.
16. Levy, A. Y., and Rousset, M.-C. 1998. Combining horn rules and description logics in CARIN. Artificial Intelligence 104(1-2):165-209.
17. Lutz, C. 2008. The complexity of conjunctive query answering in expressive description logics. In Proc. of the 4th Int. Joint Conf. on Automated Reasoning (IJCAR-08), 179-193. LNCS.
18. Motik, B.; Shearer, R.; and Horrocks, I. 2009. Hypertableau reasoning for description logics. Submitted to a journal. http://www.hermit-reasoner.com/ publications/msh08hypertableau-journal.pdf.
19. Ortiz, M.; Calvanese, D.; and Eiter, T. 2008. Data complexity of query answering in expressive description logics via tableaux. J. of Automated Reasoning 41(1):61-98.
20. Ortiz, M.; Simkus, M.; and Eiter, T. 2008. Conjunctive query answering in sh using knots. In Proc. of the 2008 Description Logic Workshop (DL-08). CEUR.
21. Ortiz, M. 2008. Extending CARIN to the description logics of the SH family. In Proc. of JELIA-08, 324-337. LNAI.
22. Pratt-Hartmann, I. 2009. Data-complexity of the twovariable fragment with counting quantifiers. Forthcoming in Information and Computation. http://arxiv.org/abs/0806.1636.
23. Rosati, R. 2006a. DL+log: Tight integration of description logics and disjunctive datalog. In Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR-06), 68-78.
24. Rosati, R. 2006b. On the decidability and finite controllability of query processing in databases with incomplete information. In Proc. of the 25th ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS 2006), 356-365. ACM Press and Addison Wesley.
25. Rosati, R. 2007a. The limits of querying ontologies. In Proc. of the Int. Conf. on Database Theory (ICDT-07), volume 4353 of LNCS, 164-178. Springer.
26. Rosati, R. 2007b. On conjunctive query answering in EL. In Proc. of the 2007 Description Logic Workshop (DL-07). CEUR.
27. Rudolph, S.; Kr ötzsch, M.; and Hitzler, P. 2008. Terminological reasoning in SHIQ with ordered binary decision diagrams. In Proc. of AAAI-08, 529-534. AAAI Press/The MIT Press.
28. van der Meyden, R. 1998. Logical approaches to incomplete information: A survey. In Logics for Databases and Information Systems, 307-356. Kluwer Academic Publisher.