Quantitative deduction and its fixpoint theory
Journal of Logic Programming
Paraconsistent logic programming
Theoretical Computer Science
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
A logic for reasoning with inconsistency
Journal of Automated Reasoning
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Knowledge and Information Systems
Exploiting conflict structures in inconsistent databases
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Theoretical Computer Science
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
Hi-index | 0.00 |
We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simultaneously embedding the database and the integrity constraints, which are mutually inconsistent in classical logic, into a theory in annotated predicate calculus -- a logic that allows non trivial reasoning in the presence of inconsistency. In this way, several goals are achieved: (a) A logical specification of the class of all minimal "repairs" of the original database, and the ability to reason about them; (b) The ability to distinguish between consistent and inconsistent information in the database; and (c) The development of computational mechanisms for retrieving consistent query answers, i.e., answers that are not affected by the violation of the integrity constraints.