Transitively relational partial meet horn contraction

Authors:
Zhiqiang Zhuang;Maurice Pagnucco
Affiliations:
National ICT Australia and ARC Centre of Excellence in Autonomous Systems, School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia;National ICT Australia and ARC Centre of Excellence in Autonomous Systems, School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 4
Cited 3

Propositional knowledge base revision and minimal change

Artificial Intelligence
Revisions of knowledge systems using epistemic entrenchment

TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Next steps in propositional horn contraction

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Horn contraction via epistemic entrenchment

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence

Definability of horn revision from horn contraction

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Belief revision within fragments of propositional logic

Journal of Computer and System Sciences
Horn clause contraction functions

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Following the recent trend of studying the theory of belief revision under the Horn fragment of propositional logic this paper develops a fully characterised Horn contraction which is analogous to the traditional transitively relational partial meet contraction [Alchourrón et al., 1985]. This Horn contraction extends the partial meet Horn contraction studied in [Delgrande and Wassermann, 2010] so that it is guided by a transitive relation that models the ordering of plausibility over sets of beliefs.