Ordering-based Representations of Rational Inference

Simple item page
dc.creatorGeorgatos, Konstantinos
dc.date2000-07-26
dc.date.accessioned2026-07-07T03:16:24Z
dc.date.available2026-07-07T03:16:24Z
dc.descriptionRational 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.
dc.description26 pages, appeared in conference proceedings, contains proofs
dc.identifierhttps://arxiv.org/abs/cs/0007039
dc.identifierhttp://arxiv.org/abs/cs/0007039
dc.identifierIn the Proceedings of the European Workshop on Logics in AI (JELIA '96). J.J. Alferes, L.M. Pereira and E. Orlowska, Eds. Lecture Notes in Artificial Intelligence, vol. 1126, pages 176-191, Springer-Verlag, 1996
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30344
dc.subjectLogic in Computer Science
dc.subjectArtificial Intelligence
dc.subjectF.4.1;I.2.3
dc.titleOrdering-based Representations of Rational Inference
dc.typetext

Files

Collections

arXiv