In previous work, I have presented approaches to nonmonotonic probabilistic reasoning, which is a probabilistic generalization of default reasoning from conditional knowledge bases. In this paper, I continue this exciting line of research. I present a new probabilistic generalization of Lehmann's lexicographic entailment, called lezλ-entailment, which is parameterized through a value λ ∈ that describes the strength of the inheritance of purely probabilistic knowledge. Roughly, the new notion of entailment is obtained from logical entailment in model-theoretic probabilistic logic by adding (i) the inheritance of purely probabilistic knowledge of strength λ, and (ii) a mechanism for resolving inconsistencies due to the inheritance of logical and purely probabilistic knowledge. I also explore the semantic properties of lexλ-entailment.
CITATION STYLE
Lukasiewicz, T. (2003). Probabilistic lexicographic entailment under variable-strength inheritance with overriding. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2711, pp. 576–587). Springer Verlag. https://doi.org/10.1007/978-3-540-45062-7_47
Mendeley helps you to discover research relevant for your work.