Prioritized conflict handing for logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Preferred Answer Sets for Ordered Logic Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
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
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Utility-based resolution of data inconsistencies
Proceedings of the 2004 international workshop on Information quality in information systems
Computing consistent query answers using conflict hypergraphs
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Clean Answers over Dirty Databases: A Probabilistic Approach
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Consistent query answering in databases
ACM SIGMOD Record
ACM Transactions on Database Systems (TODS)
Approximately dominating representatives
Theoretical Computer Science
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
Active Integrity Constraints for Database Consistency Maintenance
IEEE Transactions on Knowledge and Data Engineering
Defining relative likelihood in partially-ordered preferential structures
Journal of Artificial Intelligence Research
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Consistent query answers in the presence of universal constraints
Information Systems
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data conflict resolution using trust mappings
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
Preference-driven querying of inconsistent relational databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Database Repairing and Consistent Query Answering
Database Repairing and Consistent Query Answering
Spanners: a formal framework for information extraction
Proceedings of the 32nd symposium on Principles of database systems
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.