The complexity of promise problems with applications to public-key cryptography
Information and Control
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Information Processing Letters
Implication of clauses is undecidable
Theoretical Computer Science
On truth-table reducibility to SAT
Information and Computation
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Containment of Conjunctive Queries with Safe Negation
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Theta2p-Completeness: A Classical Approach for New Results
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On querying simple conceptual graphs with negation
Data & Knowledge Engineering
Undecidability of the Horn-clause implication problem
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Containment of conjunctive queries with negation: algorithms and experiments
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Containment of conjunctive queries over databases with null values
ICDT'07 Proceedings of the 11th international conference on Database Theory
Some algorithmic improvements for the containment problem of conjunctive queries with negation
ICDT'07 Proceedings of the 11th international conference on Database Theory
Simple conceptual graphs with atomic negation and difference
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Hi-index | 0.00 |
We 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 @P"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(@?,@?,@?"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"@?^N^P-complete for any value of k greater or equal to 3. As a corollary of our proofs, we are able to classify exactly Entailment"k for any value of k2 when g is decomposable into a tree.