Computer Science – Logic in Computer Science
Scientific paper
2000-07-26
In the Proceedings of the International Joint Conference on Qualitative and Quantitative Practical Reasoning (ESCQARU/FAPR 97)
Computer Science
Logic in Computer Science
22 pages, a paper in preliminary form that appeared later in conference proceedings
Scientific paper
We 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.
No associations
LandOfFree
Entrenchment Relations: A Uniform Approach to Nonmonotonicity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Entrenchment Relations: A Uniform Approach to Nonmonotonicity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entrenchment Relations: A Uniform Approach to Nonmonotonicity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-582110