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
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
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative 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
ConQuer: efficient management of inconsistent databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Consistent query answering in databases
ACM SIGMOD Record
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
Minimal-change integrity maintenance using tuple deletions
Information and Computation
A three-valued semantics for querying and repairing inconsistent databases
Annals of Mathematics and Artificial Intelligence
Repair localization for query answering from inconsistent databases
ACM Transactions on Database Systems (TODS)
Query evaluation with soft-key constraints
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reconciling Inconsistent Data in Probabilistic XML Data Integration
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
ACM Computing Surveys (CSUR)
Consistent query answers in the presence of universal constraints
Information Systems
Prioritized active integrity constraints for database maintenance
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Detecting and repairing anomalous evolutions in noisy environments
Annals of Mathematics and Artificial Intelligence
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this specification is incomplete, and the cleaned database may still be inconsistent. At the same time, data cleaning is a rather drastic approach to conflict resolution: It removes tuples from the database, which may lead to information loss and inaccurate query answers. We investigate an approach which constitutes an alternative to data cleaning. The approach incorporates preference-driven conflict resolution into query answering. The database is not changed. These goals are achieved by augmenting the framework of consistent query answers through various notions of preferred repair. We axiomatize desirable properties of preferred repair families and propose different notions of repair optimality. Finally, we investigate the computational complexity implications of introducing preferences into the computation of consistent query answers.