Entrenchment Relations: A Uniform Approach to Nonmonotonicity

Simple item page
dc.creatorGeorgatos, Konstantinos
dc.date2000-07-26
dc.date.accessioned2026-07-25T16:27:44Z
dc.descriptionWe show that Gabbay's nonmonotonic consequence relations can be reduced to a new family of relations, called entrenchment relations. Entrenchment relations provide a direct generalization of epistemic entrenchment and expectation ordering introduced by Gardenfors and Makinson for the study of belief revision and expectation inference, respectively.
dc.description22 pages, a paper in preliminary form that appeared later in conference proceedings
dc.identifierhttps://arxiv.org/abs/cs/0007040
dc.identifierhttp://arxiv.org/abs/cs/0007040
dc.identifierIn the Proceedings of the International Joint Conference on Qualitative and Quantitative Practical Reasoning (ESCQARU/FAPR 97), Lecture Notes in Artificial Intelligence, vol. 1244, pages 282-297, Springer-Verlag, 1997
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/41547
dc.subjectLogic in Computer Science
dc.subjectArtificial Intelligence
dc.subjectF.4.1;I.2.3
dc.titleEntrenchment Relations: A Uniform Approach to Nonmonotonicity
dc.typetext

Files

Collections

arXiv