arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.6679cs.AI
收藏

可能性逻辑基与可能性图

Possibilistic logic bases and possibilistic graphs

Institut de Recherche en Informatique de Toulouse (I.R.I.T.)(图卢兹计算机科学研究所);Universite Paul Sabatier(保罗·萨巴蒂尔大学)

Salem Benferhat, Didier Dubois, Laurent Garcia, Henri Prade

摘要:

可能性逻辑基和可能性图是两种不同的知识表示框架。前者根据知识的确定性水平对知识(用逻辑公式表示)进行分层,而后者则展示变量之间的关系。当这两种类型的表示导致相同的可能性分布(对可能的解释进行排序)时,它们在语义上是等价的。一个可能性分布可以用一个链式法则来分解,这个链式法则可以基于可能性理论中存在的两种不同类型的条件(一种基于数值设置中的乘积,一种基于定性设置中的最小运算)。这两种类型的条件作用导致两种可能性图。在这两种情况下,提供了这些图的翻译成可能性的基础。还描述了从可能性知识库到基于最小值的图的逆翻译。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑