Proceedings

Walking the Complexity Lines for Generalized Guarded Existential Rules

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 712-716.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-126

Abstract

We establish complexities of the conjunctive query entailment problem for classes of existential rules (i.e. Tuple-Generating Dependencies or Datalog+/- rules). Our contribution is twofold. First, we introduce the class of greedy bounded treewidth sets (gbts), which covers guarded rules, and their known generalizations, namely (weakly) frontier-guarded rules. We provide a generic algorithm for query entailment with gbts, which is worst-case optimal for combined complexity with bounded predicate arity, as well as for data complexity. Second, we classify several gbts classes, whose complexity was unknown, namely frontier-one, frontier-guarded and weakly frontier-guarded rules, with respect to combined complexity (with bounded and unbounded predicate arity) and data complexity.

Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph, and Michael Thomazo. 2011. Walking the Complexity Lines for Generalized Guarded Existential Rules. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 712–716. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-126
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards