Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
First-order logic and automated theorem proving
First-order logic and automated theorem proving
Propositional knowledge base revision and minimal change
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
On the logic of iterated belief revision
Artificial Intelligence
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning
Prime Implicate-based Belief Revision Operators
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We present a formal framework for theory revision that is based on a tableaux algorithm. We use a semantic tableaux system for generating the tableau of a belief base and of a revision formula. Specific revision operators can then be defined in terms of tableaux branches. Tableaux branches of a formula correspond to implicants of the formula. We define a new set of revision postulates for implicant sets and we show that they verify the AGM revision postulates. Then we consider specific distance based revision operators and in particular those based on the symmetrical difference between interpretations. We show that the minimal symmetric difference between the model sets of two implicants can be obtained by a simple binary operation on these implicants. Finally, we define three specific distance based revision operators. The representation of a formula by implicants is not unique (our approach is not based on prime implicants). We show that our implicant revision approach obtains the same revision result operated on different equivalent implicant sets for the three revision operators we propose.