Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
A logical framework for default reasoning
Artificial Intelligence
A theorem-proving approach to database integrity
Foundations of deductive databases and logic programming
Eliminating the fixed predicates from a circumscription
Artificial Intelligence
Propositional knowledge base revision and minimal change
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Unifying default reasoning and belief revision in a modal framework
Artificial Intelligence
Revision and updating in knowledge bases
Revision and updating in knowledge bases
On the logic of iterated belief revision
Artificial Intelligence
Reducing belief revision to circumscription (and vice versa)
Artificial Intelligence
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Signed Systems for Paraconsistent Reasoning
Journal of Automated Reasoning
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge
Changing Conditional Belief Unconditionally
Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge
COBA: A Consistency-Based Belief Revision System
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A Consistency-Based Model for Belief Change: Preliminary Report
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
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
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Iterated theory base change: a computational model
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Remedying inconsistent sets of premises
International Journal of Approximate Reasoning
COBA 2.0: A Consistency-Based Belief Change System
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Towards Principles for Ontology Integration
Proceedings of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008)
Journal of Artificial Intelligence Research
Belief change based on global minimisation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Secure and Optimal Base Contraction in Graded Łukasiewicz Logics
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
Secure and Optimal Base Contraction in Graded Łukasiewicz Logics
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
A program-level approach to revising logic programs under the answer set semantics
Theory and Practice of Logic Programming
Parallel belief revision: Revising by sets of formulas
Artificial Intelligence
A computational approach for belief change
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Remedying inconsistent sets of premises
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Forgetting and knowledge update
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Knowledge-Base revision using implications as hypotheses
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
A general framework for computing maximal contractions
Frontiers of Computer Science: Selected Publications from Chinese Universities
A reasoning platform based on the MI shapley inconsistency value
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A decomposition based algorithm for maximal contractions
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
This paper presents a general, consistency-based framework for expressing belief change. The framework has good formal properties while being well-suited for implementation. For belief revision, informally, in revising a knowledge base K by a sentence α, we begin with α and include as much of K as consistently possible. This is done by expressing K and α in disjoint languages, asserting that the languages agree on the truth values of corresponding atoms wherever consistently possible, and then re-expressing the result in the original language of K. There may be more than one way in which the languages of K and α can be so correlated: in choice revision, one such "extension" represents the revised state; alternately (skeptical) revision consists of the intersection of all such extensions. Contraction is similarly defined although, interestingly, it is not interdefinable with revision.The framework is general and flexible. For example, one could go on and express other belief change operations such as update and erasure, and the merging of knowledge bases. Further, the framework allows the incorporation of static and dynamic integrity constraints. The approach is well-suited for implementation: belief change can be equivalently expressed in terms of a finite knowledge base; and the scope of a belief change operation can be restricted to just those propositions common to the knowledge base and sentence for change. We give a high-level algorithm implementing the procedure, and an expression of the approach in Default Logic. Lastly, we briefly discuss two implementations of the approach.