Ordering-based Representations of Rational Inference

Details Ordering-based Representations of Rational Inference Ordering-based Representations of Rational Inference

2000-07-26

arxiv.org/abs/cs/0007039v1

In the Proceedings of the European Workshop on Logics in AI (JELIA '96). J.J. Alferes, L.M. Pereira and E. Orlowska, Eds. Lect

Computer Science

Logic in Computer Science

26 pages, appeared in conference proceedings, contains proofs

Scientific paper

Rational inference relations were introduced by Lehmann and Magidor as the ideal systems for drawing conclusions from a conditional base. However, there has been no simple characterization of these relations, other than its original representation by preferential models. In this paper, we shall characterize them with a class of total preorders of formulas by improving and extending Gardenfors and Makinson's results for expectation inference relations. A second representation is application-oriented and is obtained by considering a class of consequence operators that grade sets of defaults according to our reliance on them. The finitary fragment of this class of consequence operators has been employed by recent default logic formalisms based on maxiconsistency.

Affiliated with

Also associated with

No associations

Rating

Ordering-based Representations of Rational Inference 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 Ordering-based Representations of Rational Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ordering-based Representations of Rational Inference will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582109