The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Efficiently four-coloring planar graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of database queries
Journal of Computer and System Sciences
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Parameterized complexity for the database theorist
ACM SIGMOD Record
Condensed Representation of Database Repairs for Consistent Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Census Data Repair: a Challenging Application of Disjunctive Logic Programming
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Vertex Cover: Further Observations and Further Improvements
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
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
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Proceedings of the 14th ACM international conference on Information and knowledge management
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Minimal-change integrity maintenance using tuple deletions
Information and Computation
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
Consistent query answers on numerical databases under aggregate 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
Dynamic complexity theory revisited
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Distance semantics for database repair
Annals of Mathematics and Artificial Intelligence
Commonsense reasoning by distance semantics
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Extending dependencies with conditions
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Improving data quality: consistency and accuracy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reasoning with Uncertainty by Nmatrix---Metric Semantics
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Consistent Query Answering: The First Ten Years
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Semandaq: a data quality system based on conditional functional dependencies
Proceedings of the VLDB Endowment
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Distance-Based Non-Deterministic Semantics
Proceedings of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference
Consistent query answers in the presence of universal constraints
Information Systems
Querying and repairing inconsistent numerical databases
ACM Transactions on Database Systems (TODS)
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Data correspondence, exchange and repair
Proceedings of the 13th International Conference on Database Theory
Disjunctive databases for representing repairs
Annals of Mathematics and Artificial Intelligence
Sampling the repairs of functional dependency violations under hard constraints
Proceedings of the VLDB Endowment
Theoretical Computer Science
Detecting and repairing anomalous evolutions in noisy environments
Annals of Mathematics and Artificial Intelligence
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
Inconsistency-Tolerance in knowledge-based systems by dissimilarities
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Repair-oriented relational schemas for multidimensional databases
Proceedings of the 15th International Conference on Extending Database Technology
Repairing inconsistent dimensions in data warehouses
Data & Knowledge Engineering
Tractable cases of clean query answering under entity resolution via matching dependencies
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Extending inclusion dependencies with conditions
Theoretical Computer Science
Query answering under probabilistic uncertainty in Datalog+ / - ontologies
Annals of Mathematics and Artificial Intelligence
Sampling from repairs of conditional functional dependency violations
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering (CQA) is the problem of computing from D the answers to a query that are consistent wrt IC. Consistent answers are invariant under all the repairs of D, i.e. the consistent instances that minimally depart from D. Three classes of repair have been considered in the literature: those that minimize set-theoretically the set of tuples in the symmetric difference; those that minimize the changes of attribute values, and those that minimize the cardinality of the set of tuples in the symmetric difference. The latter class has not been systematically investigated. In this paper we obtain algorithmic and complexity theoretic results for CQA under this cardinality-based repair semantics. We do this in the usual, static setting, but also in a dynamic framework where a consistent database is affected by a sequence of updates, which may make it inconsistent. We also establish comparative results with the other two kinds of repairs in the dynamic case.