Walking the complexity lines for generalized guarded existential rules

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 712-717

  Baget, Jean François ^a   Mugnier, Marie Laure ^b   Rudolph, Sebastian ^c   Thomazo, Michaël ^b  

^a INRIA   (France)

^b UNIV MONTPELLIER   (France)

^c KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED TREEWIDTH; COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; DATA COMPLEXITY; DATALOG; GENERIC ALGORITHM; TUPLE-GENERATING DEPENDENCIES;

COMPUTER PROGRAMMING;

ARTIFICIAL INTELLIGENCE;

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

References (16)

1. J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat. Extending decidable cases for rules with existential variables. In Proc. of IJCAI'09, pages 677-682, 2009.
2. J.-F. Baget, M. Leclère, and M.-L. Mugnier. Walking the decidability line for rules with existential variables. In Proc. of KR 2010, 2010.
3. J.-F. Baget, M.-L. Mugnier, S. Rudolph, and M. Thomazo. Complexity boundaries for generalized guarded existential rules. Research Report RR-11006, LIRMM, 2011.
4. V. Bárány, G. Gottlob, and M. Otto. Querying the guarded fragment. In Proc. of LICS 2010, pages 1-10, 2010.
5. C. Beeri and M. Vardi. The implication problem for data dependencies. In Proc. of ICALP 1981, volume 115 of LNCS, pages 73-85, 1981.
6. A. Calì, G. Gottlob, and M. Kifer. Taming theinfinite chase: Query answering under expressive relational constraints. In Proc. of KR 2008, pages 70-80, 2008.
7. A. Calì, G. Gottlob, and T. Lukasiewicz. A generaldatalog-based framework for tractable query answering over ontologies. In Proc. of PODS 2009, pages 77-86, 2009.
8. A. Calì, G. Gottlob, T. Lukasiewicz, B. Marnette,and A. Pieris. Datalog+/-: A family of logical knowledge representation and query languages for new applications. In Proc. of LICS, pages 228-242, 2010.
9. A. K. Chandra, H. R. Lewis, and J. A. Makowsky. Embedded implicational dependencies and their inference problem. In Proc. of STOC 1981, pages 342-354, 1981.
10. M. Chein and M.-L. Mugnier. Graph-based Knowledge Representation and Reasoning - Computational Foundations of Conceptual Graphs. Springer, 2009.
11. B. Courcelle. The monadic second-order logic of graphs: I. recognizable sets of finite graphs. Inf. Comput., 85(1):12-75, 1990. (Pubitemid 20680563)
12. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. ACM Comp. Surveys, 33(3):374-425, 2001. (Pubitemid 33768487)
13. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005. (Pubitemid 40612385)
14. D.S. Johnson and A.C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167-189, 1984. (Pubitemid 14569352)
15. M. Krötzsch, S. Rudolph, and P. Hitzler. Complexity boundaries for Horn description logics. In Proc. of AAAI 2007, pages 452-457, 2007.
16. C. Lutz. Inverse roles make conjunctive queries hard. In Proc. of DL 2007, 2007.