On the complexity of entailment in existential conjunctive first-order logic with atomic negation

AbstractWe consider the entailment problem in the fragment of first-order logic (FOL) composed of existentially closed conjunctions of literals (without functions), denoted by FOL(∃,∧,¬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(∃,∧,¬a) is Π2P-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 Entailmentk be the following family of problems: given two formulas g and h in FOL(∃,∧,¬a), such that g has at most k pairs of exchangeable literals, is g entailed by h? The main results are that Entailmentk 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 Entailmentk for any value of k≠2 when g is decomposable into a tree