The impact of disjunction on query answering under guarded-based existential rules

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 796-802

  Bourhis, Pierre ^a   Morak, Michael ^a   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; FIRST ORDER LOGIC; INCLUSION DEPENDENCIES; LINEAR RULE; NEGATIVE CONSTRAINTS; QUERY ANSWERING; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

QUERY LANGUAGES;

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

References (29)

1. Mario Alviano, Wolfgang Faber, Nicola Leone, and Marco Manna. Disjunctive Datalog with existential quantifiers: Semantics, decidability, and complexity issues. TPLP, 12(4-5):701-718, 2012.
2. Hajnal Andréka, Johan van Benthem, and István Németi. Modal languages and bounded fragments of predicate logic. J. Philosophical Logic, 27:217-274, 1998.
3. A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. The DL-Lite family and relations. J. Artificial Intelligence Res., 36:1-69, September 2009.
4. Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL envelope. In Proc. of IJCAI, pages 364-369, 2005.
5. Franz Baader. Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In Proc. of IJCAI, pages 319-324, 2003.
6. Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. On rules with existential variables: Walking the decidability line. Artif. Intell., 175(9-10):1620-1654, 2011.
7. Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph, and Michaël Thomazo. Walking the complexity lines for generalized guarded existential rules. In Proc. of IJCAI, pages 712-717, 2011.
8. V. Bárány, G. Gottlob, and M. Otto. Querying the guarded fragment. In Proc. of LICS, pages 1-10, 2010.
9. Vince Bárány, Balder ten Cate, and Luc Segoufin. Guarded negation. In Proc. of ICALP, pages 356-367, 2011.
10. Vince Bárány, Balder ten Cate, and Martin Otto. Queries with guarded negation. PVLDB, 5(11):1328-1339, 2012.
11. Catriel Beeri and Moshe Y. Vardi. The implication problem for data dependencies. In Proc. of ICALP, pages 73-85, 1981.
12. Michael Benedikt, Pierre Bourhis, and Pierre Senellart. Monadic Datalog containment. In Proc. of ICALP, pages 79-91, 2012.
13. Henrik Björklund, Wim Martens, and Thomas Schwentick. Optimizing conjunctive queries over trees using schema information. In Proc. of MFCS, pages 132-143, 2008.
14. Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, pages 70-80, 2008.
15. Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. A general Datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14:57-83, 2012.
16. Andrea Calì, Georg Gottlob, and Andreas Pieris. Towards more expressive ontology languages: The query answering problem. Artif. Intell., 193:87-128, 2012.
17. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Data complexity of query answering in description logics. In Proc. of KR, pages 260-270, 2006.
18. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning, 39(3):385-429, 2007.
19. Alin Deutsch and Val Tannen. Reformulation of XML queries and constraints. In Proc. of ICDT, pages 225-241, 2003.
20. Alin Deutsch, Alan Nash, and Jeff B. Remmel. The chase revisisted. In Proc. of PODS, pages 149-158, 2008.
21. Thomas Eiter, Georg Gottlob, and Heikki Mannila. Disjunctive Datalog. ACM Trans. Database Syst., 22(3):364-418, 1997.
22. Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
23. Georg Gottlob, Marco Manna, Michael Morak, and Andreas Pieris. On the complexity of ontological reasoning under disjunctive existential rules. In Proc. of MFCS, pages 1-18, 2012.
24. Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research. Springer, 2002.
25. Markus Krötzsch and Sebastian Rudolph. Extending decidable existential rules by joining acyclicity and guardedness. In Proc. of IJCAI, pages 963-968, 2011.
26. Nicola Leone, Marco Manna, Giorgio Terracina, and Pierfrancesco Veltri. Efficiently computable Datalog programs. In Proc. of KR, 2012.
27. C. Lutz. The complexity of conjunctive query answering in expressive description logics. In A. Armando, P. Baumgartner, and G. Dowek, editors, Automated Reasoning, volume 5195 of LNCS, pages 179-193. Springer Berlin / Heidelberg, 2008.
28. Peter F. Patel-Schneider and Ian Horrocks. A comparison of two modelling paradigms in the semantic web. J. Web Semantics, 5(4):240-250, 2007.
29. Michaël Thomazo, Jean-François Baget, Marie-Laure Mugnier, and Sebastian Rudolph. A generic querying algorithm for greedy sets of existential rules. In Proc. of KR, 2012.