Foundations of logic programming
Foundations of logic programming
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Journal of the ACM (JACM)
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Journal of Automated Reasoning
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Handbook of logic in artificial intelligence and logic programming (vol. 3)
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Reducing belief revision to circumscription (and vice versa)
Artificial Intelligence
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing Circumscription Revisited: A Reduction Algorithm
Journal of Automated Reasoning
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases
Proceedings of the 17th International Conference on Logic Programming
Analytic Tableaux and Database Repairs: Foundations
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
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
Compiling Circumscriptive Theories into Logic Programs
Proceedings of the 2nd International Workshop on Non-Monotonic Reasoning
A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic
Proceedings of the 10th International Conference on Automated Deduction
Proceedings of the 2nd international conference on Semantics in databases
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Foundational Challenges in Automated Semantic Web Data and Ontology Cleaning
IEEE Intelligent Systems
Distance semantics for database repair
Annals of Mathematics and Artificial Intelligence
Distance-Based repairs of databases
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
In this article, we characterize in terms of analytic tableaux the repairs of inconsistent relational databases, that is databases that do not satisfy a given set of integrity constraints. For this purpose we provide closing and opening criteria for branches in tableaux that are built for database instances and their integrity constraints. We use the tableaux based characterization as a basis for consistent query answering, that is for retrieving from the database answers to queries that are consistent with respect to the integrity constraints.