Nonmonotonic inference operations
<|reference_start|>Nonmonotonic inference operations: A. 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.<|reference_end|>
@article{freund2002nonmonotonic,
    title={Nonmonotonic inference operations},
    author={Michael Freund and Daniel Lehmann},
    journal={Bulletin of the IGPL, Vol. 1 no. 1 (July 1993), pp. 23-68},
    year={2002},
    number={Leibniz Center for Research in Computer Science: TR-92-2},
    archivePrefix={arXiv},
    eprint={cs/0202031},
    primaryClass={cs.AI}
}