论文部分内容阅读
条件偏好网(CP-nets)是一种表示定性条件偏好关系的语言.针对目前CP-nets的图形表示方法难以实现运算的特点提出一种二值无环CP-nets的代数表示方法.该方法将CP-nets组织成邻接链表的形式,纵向存储CP-nets拓扑排序的序列,其结点域以命题逻辑的主析取范式来表示二值CP-nets的条件偏好表.横向存储各个顶点的父亲集,它对应决策属性的条件集.随后基于CP-nets的代数表示方法,研究二值无环CP-nets上的直接模型和间接模型的求取算法.实验结果表明,CP-nets不仅能用直观的图形来表示,也可用紧凑的代数方法来表示.
CP-nets is a language that represents the preference relationship of qualitative conditions. Aiming at the characteristics of CP-nets, which is difficult to be operated, an algebraic representation method of binary acyclic CP-nets is proposed. The CP-nets are organized in the form of contiguous linked lists, which store the sequences of topologically sorted CP-nets in the vertical direction, and the node domain represents the conditional preference table of binary CP-nets in terms of the masterstroke logic of the propositional logic. Father set, which corresponds to the condition set of decision attributes.And then based on algebraic representation of CP-nets, we study the algorithm of direct model and indirect model on binary acyclic CP-nets.The experimental results show that CP-nets not only can With intuitive graphics to represent, but also can be used to represent the compact algebra.