Possibilistic and Standard Probabilistic Semantics of Conditional Knowledge Bases - Université d'Artois Access content directly
Journal Articles Journal of Logic and Computation Year : 1999

Possibilistic and Standard Probabilistic Semantics of Conditional Knowledge Bases

Abstract

Default pieces of information of the form, 'generally, if α then β' can be modelled by constraints expressing that, when α is true, β is more plausible than its negation. In previous works, the authors have cast this view in the framework of comparative possibility theory, showing that a set of default rules is equivalent to a set of comparative possibility distributions, each encoding an epistemic state. A representation theorem in terms of this semantics, for default reasoning obeying the System P of postulates proposed by Kraus, Lehmann and Magidor, has been obtained. This paper offers a detailed analysis of the structure of comparative possibility distributions representing default knowledge, by laying bare two different relations between epistemic states: the specificity ordering and the informativeness ordering. It is shown that the representation theorem still holds when restricting to linear comparative possibility distributions. They correspond to all the possible completions of the default knowledge by means of a so-called completion rule of inference. As a consequence of this result we provide a standard probabilistic semantics to System P, without referring to infinitesimals (used in Adams' semantics, revisited by Pearl). It relies on a special family of probability measures, that we call big-stepped probabilities, recently considered by Snow.

Dates and versions

hal-03299690 , version 1 (26-07-2021)

Identifiers

Cite

Salem Benferhat, Didier Dubois, Henri Prade. Possibilistic and Standard Probabilistic Semantics of Conditional Knowledge Bases. Journal of Logic and Computation, 1999, 9 (6), pp.873-895. ⟨10.1093/logcom/9.6.873⟩. ⟨hal-03299690⟩
22 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More