Walking the Decidability Line for Rules with Existential Variables - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports Year : 2009

Walking the Decidability Line for Rules with Existential Variables

Abstract

We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have the same logical form as TGD (tuple-generating dependencies) in databases and as conceptual graph rules. The aim of this paper is to provide a clearer picture of the frontier between decidability and non-decidability of reasoning with these rules. We show that Deduction remains undecidable with a single rule; then we show that none of the known abstract decidable classes is recognizable. Turning our attention to concrete decidable classes, we provide new classes and classify all known classes by inclusion. Finally, we study, in a systematic way, the question ``given two decidable sets of rules, is their union decidable?'', and provide an answer for all known decidable cases except one.
No file

Dates and versions

lirmm-00441907 , version 1 (17-12-2009)

Identifiers

  • HAL Id : lirmm-00441907 , version 1

Cite

Jean-François Baget, Michel Leclère, Marie-Laure Mugnier. Walking the Decidability Line for Rules with Existential Variables. RR-09030, 2009, pp.21. ⟨lirmm-00441907⟩
154 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More