Nonmonotonic inference operations

Simple item page
dc.creatorFreund, Michael
dc.creatorLehmann, Daniel
dc.date2002-02-20
dc.date.accessioned2026-07-07T03:18:09Z
dc.date.available2026-07-07T03:18:09Z
dc.descriptionA. Tarski proposed the study of infinitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations. In this paper, we weaken the monotonicity requirement and consider more general operations, inference operations. These operations describe the nonmonotonic logics both humans and machines seem to be using when infering defeasible information from incomplete knowledge. We single out a number of interesting families of inference operations. This study of infinitary inference operations is inspired by the results of Kraus, Lehmann and Magidor on finitary nonmonotonic operations, but this paper is self-contained.
dc.description54 pages. A short version appeared in Studia Logica, Vol. 53 no. 2 (1994) pp. 161-201
dc.identifierhttps://arxiv.org/abs/cs/0202031
dc.identifierhttp://arxiv.org/abs/cs/0202031
dc.identifierBulletin of the IGPL, Vol. 1 no. 1 (July 1993), pp. 23-68
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31001
dc.subjectArtificial Intelligence
dc.subjectI.2.3
dc.titleNonmonotonic inference operations
dc.typetext

Files

Collections

arXiv