Abstract
When a proposition α is cumulatively entailed by a finite setA of premisses, there exists, trivially, a finite subsetB ofA such thatB ∪B′ entails α for all finite subsetsB′ that are entailed byA. This property is no longer valid whenA is taken to be an arbitrary infinite set, even when the considered inference operation is supposed to be compact. This leads to a refinement of the classical definition of compactness. We call supracompact the inference operations that satisfy the non-finitary analogue of the above property. We show that for any arbitrary cumulative operationC, there exists a supracompact cumulative operationK(C) that is smaller thenC and agrees withC on finite sets. Moreover,K(C) inherits most of the properties thatC may enjoy, like monotonicity, distributivity or disjunctive rationality. The main part of the paper concerns distributive supracompact operations. These operations satisfy a simple functional equation, and there exists a representation theorem that provides a semantic characterization for this family of operations. We examine finally the case of rational operations and show that they can be represented by a specific kind of model particularly easy to handle.
Similar content being viewed by others
References
M. Freund,A semantic characterization of disjunctive relations, FAIR'91, Lecture Notes in Artificial Intelligence N° 535, Fundamentals of Artificial Intelligence, International Workshop, Springer-Verlag, Berlin, pp. 72 – 83.
M. Freund andD. Lehmann,Deductive inference operations, JELIA'90, Logics in A.I., Lecture Notes in Artificial Intelligence, European Workshop, Springer-Verlag, Berlin, pp. 227 – 233.
M. Freund andD. Lehmann Non-monotonic inference operations. (Submitted)
M. Freund, D. Lehmann andD. Makinson,Canonical extension to the infinite case of finitary non-monotonic inference relations, Arbeitespapiere der GMD n° 443: Proceedings of the Workshop on Non-monotonic Reasoning, 1990, pp. 133 – 138.
S. Kraus, D. Lehmann andM. Magidor,Non-monotonic reasoning, preferential models and cumulative logics, Artificial Intelligence 44, pp. 167 – 207.
D. Lehmann andM. Magidor,Rational logics and their models: a study in cumulative logic Technical report TR 88–16, Leibnitz Center for Computer Science, Dept. of Computer Science, Hebrew University, Jerusalem, November 1988.
D. Makinson,General patterns in non-monotonic reasoning, chapter 2 ofHandbook of Logic in Artificial Intelligence and Logic Programming, Vol. II, Oxford University Press, to appear.
M. Freund, D. Lehmann andP. Moris,Rationality, transitivity, and contraposition Artificial Intelligence 52 (1991), pp. 191–203.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Freund, M. Supracompact inference operations. Stud Logica 52, 457–481 (1993). https://doi.org/10.1007/BF01057658
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01057658