Introduction to algorithms
Chasing constrained tuple-generating dependencies
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint-generating dependencies
Journal of Computer and System Sciences
Declarative problem-solving in DLV
Logic-based artificial intelligence
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Database Management Systems
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases
Proceedings of the 17th International Conference on Logic Programming
Condensed Representation of Database Repairs for Consistent Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Logic Programs for Querying Inconsistent Databases
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Preferred Answer Sets for Ordered Logic Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Scalar aggregation in inconsistent databases
Theoretical Computer Science - Database theory
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Logical Framework for Querying and Repairing Inconsistent Databases
IEEE Transactions on Knowledge and Data Engineering
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Computing consistent query answers using conflict hypergraphs
Proceedings of the thirteenth ACM international conference on Information and knowledge management
A cost-based model and effective heuristic for repairing constraints by value modification
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Consistent query answering under key and exclusion dependencies: algorithms and experiments
Proceedings of the 14th ACM international conference on Information and knowledge management
Consistent query answering in databases
ACM SIGMOD Record
First-order query rewriting for inconsistent databases
Journal of Computer and System Sciences
Repair localization for query answering from inconsistent databases
ACM Transactions on Database Systems (TODS)
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
On the consistent rewriting of conjunctive queries under primary key constraints
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
ICDT'07 Proceedings of the 11th international conference on Database Theory
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First-order query rewriting for inconsistent databases
ICDT'05 Proceedings of the 10th international conference on Database Theory
Preference-driven querying of inconsistent relational databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Efficient policy-based inconsistency management in relational knowledge bases
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
Theoretical Computer Science
Conflict-aware historical data fusion
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
On the data complexity of consistent query answering
Proceedings of the 15th International Conference on Database Theory
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
Belief revision within fragments of propositional logic
Journal of Computer and System Sciences
Query answering under probabilistic uncertainty in Datalog+ / - ontologies
Annals of Mathematics and Artificial Intelligence
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.01 |
The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this article we study the complexity of consistent query answers and repair checking in the presence of universal constraints. We propose an extended version of the conflict hypergraph which allows to capture all repairs w.r.t. a set of universal constraints. We show that repair checking is in PTIME for the class of full tuple-generating dependencies and denial constraints, and we present a polynomial repair algorithm. This algorithm is sound, i.e. always produces a repair, but also complete, i.e. every repair can be constructed. Next, we present a polynomial-time algorithm computing consistent answers to ground quantifier-free queries in the presence of denial constraints, join dependencies, and acyclic full tuple-generating dependencies. Finally, we show that extending the class of constraints leads to intractability. For arbitrary full tuple-generating dependencies consistent query answering becomes coNP-complete. For arbitrary universal constraints consistent query answering is @P"2^p-complete and repair checking coNP-complete.