Skip to Main content Skip to Navigation
Conference papers

Possibilistic logic bases and possibilistic graphs

Abstract : Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. The former stratifies 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 representations 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 which exist in possibility theory (one based on product in a numerical setting, one based on minimum operation in a qualitative setting). These two types of conditioning induce two kinds of possibilistic graphs. 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 :
Conference papers
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03299825
Contributor : Fabien Delorme <>
Submitted on : Monday, July 26, 2021 - 4:56:08 PM
Last modification on : Friday, September 10, 2021 - 11:35:07 AM

Links full text

Identifiers

  • HAL Id : hal-03299825, version 1
  • ARXIV : 1301.6679

Citation

Salem Benferhat, Didier Dubois, Laurent Garcia, Henri Prade. Possibilistic logic bases and possibilistic graphs. 15th Conference on Uncertainty in Artificial Intelligence (UAI 1999), 1999, Stockholm, Sweden. pp.57-64. ⟨hal-03299825⟩

Share

Metrics

Record views

16