Skip to Main content Skip to Navigation
Journal articles

On the transformation between possibilistic logic bases and possibilistic causal networks

Abstract : Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. The former ranks the pieces of knowledge (expressed by logical formulas) according to their level of certainty, while the latter exhibits relationships between variables. The two types of representation are semantically equivalent when they lead to the same possibility distribution (which rank-orders the possible interpretations). A possibility distribution can be decomposed using a chain rule which may be based on two different kinds of conditioning that exist in possibility theory (one based on the product in a numerical setting, one based on the minimum operation in a qualitative setting). These two types of conditioning induce two kinds of possibilistic graphs. This article deals with the links between the logical and the graphical frameworks in both numerical and quantitative settings. In both cases, a translation of these graphs into possibilistic bases is provided. The converse translation from a possibilistic knowledge base into a min-based graph is also described.
Document type :
Journal articles
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03299567
Contributor : Fabien Delorme Connect in order to contact the contributor
Submitted on : Monday, July 26, 2021 - 3:24:43 PM
Last modification on : Friday, September 10, 2021 - 2:13:37 PM

Links full text

Identifiers

Citation

Salem Benferhat, Didier Dubois, Laurent Garcia, Henri Prade. On the transformation between possibilistic logic bases and possibilistic causal networks. International Journal of Approximate Reasoning, Elsevier, 2002, 29 (2), pp.135-173. ⟨10.1016/S0888-613X(01)00061-5⟩. ⟨hal-03299567⟩

Share

Metrics

Record views

19