Walking the Complexity Lines for Generalized Guarded Existential Rules - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2011

Walking the Complexity Lines for Generalized Guarded Existential Rules

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.
No file

Dates and versions

lirmm-00618081 , version 1 (31-08-2011)

Identifiers

  • HAL Id : lirmm-00618081 , version 1

Cite

Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph, Michaël Thomazo. Walking the Complexity Lines for Generalized Guarded Existential Rules. IJCAI: International Joint Conference on Artificial Intelligence, Jul 2011, Barcelona, Spain. pp.712-717. ⟨lirmm-00618081⟩
229 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More