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

1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Keywords :
Type de document :
Rapport
RR-11026, 2009, pp.46

Littérature citée [24 références]

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00413699
Contributeur : Marie-Laure Mugnier <>
Soumis le : vendredi 2 septembre 2011 - 19:59:55
Dernière modification le : mercredi 12 décembre 2018 - 14:38:02
Document(s) archivé(s) le : samedi 3 décembre 2011 - 02:27:06

Fichier

RR-11026-27March2011.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

• HAL Id : lirmm-00413699, version 2

Citation

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〉

Métriques

Consultations de la notice

445

Téléchargements de fichiers