Propositional knowledge base revision and minimal change
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Journal of Symbolic Logic
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Revising Nonmonotonic Theories: The Case of Defeasible Logic
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
The Description Logic Handbook
The Description Logic Handbook
On Generalizing the AGM Postulates
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
On the Logic of Theory Change: Relations between Incision and Selection Functions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Horn complements: towards horn-to-horn belief revision
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Next steps in propositional horn contraction
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Base Revision for Ontology Debugging
Journal of Logic and Computation
Horn Belief Change: A Contraction Core
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Journal of Artificial Intelligence Research
Horn contraction via epistemic entrenchment
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Minimal change: Relevance and recovery revisited
Artificial Intelligence
Definability of horn revision from horn contraction
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Horn clause contraction functions
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Standard belief change assumes an underlying logic containing full classical propositional logic. However, there are good reasons for considering belief change in less expressive logics as well. In this paper we build on recent investigations by Delgrande on contraction for Horn logic. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. This result stands in contrast to Delgrande's conjecture that orderly maxichoice is the appropriate form of contraction for Horn logic. We then define a more appropriate notion of basic contraction for the Horn case, influenced by the convexity property holding for full propositional logic and which we refer to as infra contraction. The main contribution of this work is a result which shows that the construction method for Horn contraction for belief sets based on our infra remainder sets corresponds exactly to Hansson's classical kernel contraction for belief sets, when restricted to Horn logic. This result is obtained via a detour through contraction for belief bases. We prove that kernel contraction for belief bases produces precisely the same results as the belief base version of infra contraction. The use of belief bases to obtain this result provides evidence for the conjecture that Horn belief change is best viewed as a `hybrid' version of belief set change and belief base change. One of the consequences of the link with base contraction is the provision of a representation result for Horn contraction for belief sets in which a version of the Core-retainment postulate features.