Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
A comparative analysis of methodologies for database schema integration
ACM Computing Surveys (CSUR)
Propositional knowledge base revision and minimal change
Artificial Intelligence
ACM Transactions on Database Systems (TODS)
Resolution for quantified Boolean formulas
Information and Computation
Integration of weighted knowledge bases
Artificial Intelligence
On the logic of iterated belief revision
Artificial Intelligence
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
A polynomial time computable metric between point sets
Acta Informatica
Information, Uncertainty, and Fusion
Information, Uncertainty, and Fusion
LUPS---a language for updating logic programs
Artificial Intelligence
Possibilistic Merging and Distance-Based Fusion of Propositional Information
Annals of Mathematics and Artificial Intelligence
Signed Systems for Paraconsistent Reasoning
Journal of Automated Reasoning
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
Journal of Automated Reasoning
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Consistent Answers from Integrated Data Sources
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases
Proceedings of the 17th International Conference on Logic Programming
A Logical Framework for Integrating Inconsistent Information in Multiple Databases
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
The Principle of Conditional Preservation in Belief Revision
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Modeling Paraconsistent Reasoning by Classical Logic
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Analytic Tableaux and Database Repairs: Foundations
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Improvements to the Evaluation of Quantified Boolean Formulae
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
A Thorough Axiomatization of a Principle of Conditional Preservation in Belief Revision
Annals of Mathematics and Artificial Intelligence
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
On Computing Belief Change Operations using Quantified Boolean Formulas
Journal of Logic and Computation
Coherent integration of databases by abductive logic programming
Journal of Artificial Intelligence Research
Querying inconsistent databases
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Distance semantics for database repair
Annals of Mathematics and Artificial Intelligence
Commonsense reasoning by distance semantics
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Distance-based paraconsistent logics
International Journal of Approximate Reasoning
Distance-Based repairs of databases
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Independent update reflections on interdependent database views
Conceptual Modelling and Its Theoretical Foundations
Information-based distance measures and the canonical reflection of view updates
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
We introduce a simple and practical method for repairing inconsistent databases. Given a possibly inconsistent database, the idea is to properly represent the underlying problem, i.e., to describe the possible ways of restoring its consistency. We do so by what we call signed formulae, and show how the `signed theory' that is obtained can be used by a variety of off-the-shelf computational models in order to compute the corresponding solutions, i.e., consistent repairs of the database.