A Textbook of Belief Dynamics: Solutions to Exercises
A Textbook of Belief Dynamics: Solutions to Exercises
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
A General Framework for Revising Non-Monotonic Theories
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Revising Nonmonotonic Theories: The Case of Defeasible Logic
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Updates in answer set programming: An approach based on basic structural properties
Theory and Practice of Logic Programming
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
On Semantic Update Operators for Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
| Hi-index | 0.00 |
We present a principled approach to the problem of belief revision in (non-monotonic) logic programming under the answer set semantics. Unlike previous approaches we use a belief base approach. Belief bases are sets of sentences that are, in contrast to belief sets, not deductively closed. We show that many of the classic base revision postulates are applicable to the logic programming case. We discuss further postulates for logic program revision and show that many of them follow from classical base revision postulates. For those postulates that do not follow from base revision postulates we propose new postulates that may also be justified from the base revision perspective. Moreover we develop a new construction for prioritized multiple base revision based on a consolidation operation via remainder sets. This construction is applicable in both the classical propositional and the logic programming cases. We connect postulates and construction by proving a representation theorem showing that the construction is exactly characterized by the proposed set of postulates.