Probabilistic Lexicographic Entailment under Variable-Strength Inheritance with Overriding

  • Thomas Lukasiewicz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2711)


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 lexλ-entailment, which is parameterized through a value λ ∈ [0,1] 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Thomas Lukasiewicz
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomeItaly

Personalised recommendations