Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
ACM Transactions on Database Systems (TODS)
A semantics for reasoning consistently in the presence of inconsistency
Artificial Intelligence
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Reasoning in Inconsistent Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
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
Query Answering in Information Systems with Integrity Constraints
Proceedings of the IFIP TC11 Working Group 11.5, First Working Conference on Integrity and Internal Control in Information Systems: Increasing the confidence in Information Systems
Integrating data from possibly inconsistent databases
COOPIS '96 Proceedings of the First IFCIS International Conference on Cooperative Information Systems
Conflict Tolerant Queries in AURORA
COOPIS '99 Proceedings of the Fourth IECIS International Conference on Cooperative Information Systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The aim of this paper consists in investigating the problem of managing inconsistent databases, i.e. databases violating integrity constraints. A flurry of research on this topic has shown that the presence of inconsistent data can be resolved by “repairing” the database, i.e. by providing a computational mechanism that ensures obtaining consistent “scenarios” of the information or by consistently answer to queries posed on an inconsistent set of data. This paper considers preferences among repairs and possible answers by introducing a partial order among them on the basis of some preference criteria. Moreover, the paper also extends the notion of preferred consistent answer by extracting from a set of preferred repaired database, the maximal consistent overlapping portion of the information, i.e. the information supported by each preferred repaired database.