On the Complexity of Entailment in Existential Conjunctive First Order Logic with Atomic Negation - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports Year : 2009

On the Complexity of Entailment in Existential Conjunctive First Order Logic with Atomic Negation

Geneviève Simonet
  • Function : Author
  • PersonId : 922824
Michaël Thomazo

Abstract

We consider the entailment problem in the fragment of first-order logic (FOL) composed of existentially closed conjunctions of literals (without functions), denoted FOL$(\exists,\wedge,\neg_a)$. This problem can be recast as several fundamental problems in artificial intelligence and databases, namely query containment for conjunctive queries with negation, clause entailment for clauses without functions and query answering with incomplete information for Boolean conjunctive queries with negation over a fact base. Entailment in FOL$(\exists,\wedge,\neg_a)$ is $\Pi_2^P$-complete, whereas it is only NP-complete when the formulas contain no negation. We investigate the role of specific literals in this complexity increase. These literals have the property of being ''exchangeable'', with this notion taking the structure of the formulas into account. To focus on the structure of formulas, we shall see them as labeled graphs. Graph homomorphism, which provides a sound and complete proof procedure for positive formulas, is at the core of this study. Let Entailment$_k$ be the following family of problems: given two formulas $g$ and $h$ in FOL$(\exists,\wedge,\neg_a)$, such that $g$ has at most $k$ pairs of exchangeable literals, is $g$ entailed by $h$? The main results are that Entailment$_k$ is NP-complete if $k$ is less or equal to 1, and $P^{NP}_{||}$-complete for any value of $k$ greater or equal to 3. As a corollary of our proofs, we are able to classify exactly previous problems when $g$ is decomposable into a tree.
Fichier principal
Vignette du fichier
RR-11026-27March2011.pdf (338.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00413699 , version 1 (04-09-2009)
lirmm-00413699 , version 2 (02-09-2011)

Identifiers

  • HAL Id : lirmm-00413699 , version 2
  • PRODINRA : 246135

Cite

Marie-Laure Mugnier, Geneviève Simonet, Michaël Thomazo. On the Complexity of Entailment in Existential Conjunctive First Order Logic with Atomic Negation. RR-11026, 2009, pp.46. ⟨lirmm-00413699v2⟩
340 View
349 Download

Share

Gmail Facebook X LinkedIn More