Containment of regular path queries under description logic constraints

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 805-812

  Calvanese, Diego ^a   Ortiz, Magdalena ^b   Šimkus, Mantas ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; DESCRIPTION LOGIC; DOMAIN CONSTRAINT; EXPRESSIVE DESCRIPTION LOGIC; KNOWLEDGE BASIS; QUERY CONTAINMENT; REGULAR PATH QUERIES; UPPER BOUND;

ARTIFICIAL INTELLIGENCE; DATA DESCRIPTION; FORMAL LANGUAGES;

QUERY LANGUAGES;

EID: 84881033685     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-141     Document Type: Conference Paper

References (20)

1. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. AddisonWesley Publ. Co., 1995.
2. Franz Baader, Diego Calvanese, Deborah McGuinness, Daniele Nardi, and Peter F. Patel- Schneider, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2nd edition, 2007.
3. Bablo Barcelò, Carlos A. Hurtado, Leonid Libkin, and Peter T. Wood. Expressive languages for path queries over graph-structured data. In Proc. of the 29th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2010), pages 3-14, 2010.
4. Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. On the decidability of query containment under constraints. In Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'98), pages 149-158, 1998.
5. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. Containment of conjunctive regular path queries with inverse. In Proc. of the 7th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2000), pages 176-185, 2000.
6. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. Reasoning on regular path queries. SIGMOD Record, 32(4):83-92, 2003.
7. Diego Calvanese, Thomas Eiter, and Magdalena Ortiz. Regular path queries in expressive description logics with nominals. In Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI 2009), pages 714-720, 2009.
8. Ashok K. Chandra and Philip M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. of the 9th ACM Symp. on Theory of Computing (STOC'77), pages 77-90, 1977.
9. Surajit Chaudhuri and Moshe Y. Vardi. On the equivalence of recursive and nonrecursive datalog programs. J. of Computer and System Sciences, 54(1):61-78, 1997.
10. Thomas Eiter, Carsten Lutz, Magdalena Ortiz, and Mantas Šimkus. Query answering in description logics with transitive roles. In Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI 2009), pages 759-764, 2009.
11. Birte Glimm, Ian Horrocks, Carsten Lutz, and Uli Sattler. Conjunctive query answering for the description logic SHIQ. J. of Artificial Intelligence Research, 31:151-198, 2008.
12. David S. Johnson and Anthony C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences, 28(1):167-189, 1984.
13. Yevgeny Kazakov. RIQ and SROIQ are harder than SHOIQ. In Proc. of the 11th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2008), pages 274-284, 2008.
14. Alon Y. Levy and Marie-Christine Rousset. Verification of knowledge bases based on containment checking. Artificial Intelligence, 101(1-2):227-250, 1998.
15. Carsten Lutz. The complexity of conjunctive query answering in expressive description logics. In Proc. of the 4th Int. Joint Conf. on Automated Reasoning (IJCAR 2008), volume 5195 of Lecture Notes in Artificial Intelligence, pages 179-193. Springer, 2008.
16. Sebastian Rudolph, Markus Krotzsch, and Pascal Hitzler. Terminological reasoning in SHIQ with ordered binary decision diagrams. In Proc. of the 23rd AAAI Conf. on Artificial Intelligence (AAAI 2008), pages 529-534, 2008.
17. Yehoshua Sagiv. Optimizing Datalog programs. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 659-698. Morgan Kaufmann, 1988.
18. Oded Shmueli. Equivalence of Datalog queries is undecidable. J. of Logic Programming, 15(3):231-241, 1993.
19. Balder ten Cate and Carsten Lutz. The complexity of query containment in expressive fragments of XPath 2.0. J. of the ACM, 56(6), 2009.
20. Moshe Y. Vardi. Reasoning about the past with two-way automata. In Proc. of the 25th Int. Coll. on Automata, Languages and Programming (ICALP'98), volume 1443 of Lecture Notes in Computer Science, pages 628-641. Springer, 1998.