Skip to Main content Skip to Navigation

Complexity Boundaries for Generalized Guarded Existential Rules

Jean-François Baget 1 Marie-Laure Mugnier 1 Sebastian Rudolph 2 Michaël Thomazo 1 
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In this report, we establish complexities of the conjunctive query entailment problem for classes of existential rules (also called Tuple-Generating Dependencies or Datalog+/- rules). Our contribution is twofold. First, we introduce the class of \emph{greedy bounded treewidth sets} \emph{(gbts)} of rules, which covers guarded rules, and their known generalizations, namely (weakly) frontier-guarded rules. We provide a generic algorithm for query entailment with \emph{gbts}, which is worst-case optimal for combined complexity with bounded predicate arity, as well as for data complexity. Secondly, we classify several \emph{gbts} classes, whose complexity was unknown, namely frontier-one, frontier-guarded and weakly frontier-guarded rules, with respect to combined complexity (with both unbounded and bounded predicate arity) and data complexity.
Document type :
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Marie-Laure Mugnier Connect in order to contact the contributor
Submitted on : Wednesday, March 23, 2011 - 7:00:22 AM
Last modification on : Friday, August 5, 2022 - 3:03:00 PM
Long-term archiving on: : Friday, June 24, 2011 - 2:25:50 AM


Files produced by the author(s)


  • HAL Id : lirmm-00568935, version 1
  • PRODINRA : 246571



Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph, Michaël Thomazo. Complexity Boundaries for Generalized Guarded Existential Rules. RR-11006, 2011, 39 p. ⟨lirmm-00568935⟩



Record views


Files downloads