On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic (TOCL)
A Textbook of Belief Dynamics: Solutions to Exercises
A Textbook of Belief Dynamics: Solutions to Exercises
Horn complements: towards horn-to-horn belief revision
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
On the link between partial meet, kernel, and infra contraction and its application to Horn logic
Journal of Artificial Intelligence Research
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Transitively relational partial meet horn contraction
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
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 contraction assumes an underlying logic containing full classical propositional logic, but there are good reasons for considering contraction in less expressive logics. In this paper we focus on Horn logic. In addition to being of interest in its own right, our choice is motivated by the use of Horn logic in several areas, including ontology reasoning in description logics. We consider three versions of contraction: entailment-based and inconsistency-based contraction (e-contraction and i-contraction, resp.), introduced by Delgrande for Horn logic, and package contraction (p-contraction), studied by Fuhrmann and Hansson for the classical case. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. We define more appropriate notions of basic contraction for all three types above, and provide associated representation results in terms of postulates. Our results stand in contrast to Delgrande's conjectures that orderly maxichoice is the appropriate contraction for both e- and i-contraction. Our interest in p-contraction stems from its relationship with an important reasoning task in ontological reasoning: repairing the subsumption hierarchy in EL. This is closely related to p-contraction with sets of basic Horn clauses (Horn clauses of the form p → q). We show that this restricted version of p-contraction can also be represented as i-contraction.