Extending decidable cases for rules with existential variables

  • Authors:
  • Jean-François Baget;Michel Leclère;Marie-Laure Mugnier;Êric Salvat

  • Affiliations:
  • INRIA Sophia-Antipolis, LIRMM;LIRMM, Univ. Montpellier, CNRS;LIRMM, Univ. Montpellier, CNRS;IMERIR, LIRMM

  • Venue:
  • IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In ∀∃-rules, the conclusion may contain existentially quantified variables, which makes reasoning tasks (as deduction) non-decidable. These rules have the same logical form as TGD (tuple-generating dependencies) in databases and as conceptual graph rules. We extend known decidable cases by combining backward and forward chaining schemes, in association with a graph that captures exactly the notion of dependency between rules. Finally, we draw a map of known decidable cases, including an extension obtained by combining our approach with very recent results on TGD.