Extending Decidable Cases for Rules with Existential Variables - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2009

Extending Decidable Cases for Rules with Existential Variables

Abstract

In the rules considered, 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.
No file

Dates and versions

lirmm-00410130 , version 1 (17-08-2009)

Identifiers

  • HAL Id : lirmm-00410130 , version 1

Cite

Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat. Extending Decidable Cases for Rules with Existential Variables. IJCAI: International Joint Conference on Artificial Intelligence, Jul 2009, Pasadena, CA, United States. pp.677-682. ⟨lirmm-00410130⟩
163 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More