CP- and OCF-networks - a comparison

详细信息    查看全文

• 作者：Christian Eichhorn^a ; ^{christian.eichhorn@tu-dortmund.de" class="auth_mail" title="E-mail the corresponding author} ; Matthias Fey^b ; ^{matthias.fey@tu-dortmund.de" class="auth_mail" title="E-mail the corresponding author} ; Gabriele Kern-Isberner^a ; ^{gabriele.kern-isberner@cs.tu-dortmund.de" class="auth_mail" title="E-mail the corresponding author}
• 关键词：CP-network ; OCF-network ; Acyclic network ; Ranking function ; Ceteris paribus ; Preference ; Preferential models
• 刊名：Fuzzy Sets and Systems
• 出版年：2016
• 出版时间：1 September 2016
• 年：2016
• 卷：298
• 期：Complete
• 页码：109-127
• 全文大小：611 K

文摘

Network approaches are used to structure, partition and display formalisms in the area of knowledge representation as well as decision making. Known approaches are, for instance, OCF-networks, Bayesian style networks where every variable is annotated with a conditional ranking table, and CP-networks, directed acyclic networks with local preferences annotated at each vertex. The structures of these networks are similar, but their semantics seem to be quite different. In this paper we discuss if OCF-networks can be used to model the information of CP-networks and vice versa. To answer this question we investigate which restrictions and conditions have to be presupposed to either of the approaches such that one structure can be used to generate the other.