CP-nets的定性偏好决策及一致性推理

CPnets是一种简单而又直观的图形化偏好表示工具，特别适合描述不完全信息下的具有依赖关系的多属性 定性偏好决策。首先通过构造CP-net s导出图及对其性质的研究，得出强占优测试本质上是导出图上顶点之间的可 达性问题，从而利用图的深度优先通历算法实现了二值网的强占优测试;然后分别从无环图、有环图的角度给出CP- nets一致性的相关定理和性质，提出了判断一致性的3种方法，使得CP-nets的一致性问题得到解决;强化和扩充了 I3outilier所提出的一些概念，深化了CP-net s的基础理论研究。

Qualitative Preference Decision and Reasoning of Consistency for CP-nets

CP-nets (condition preference networks) is a simple and intuitive graphical tool for representing conditional ceteris paribus (all other things being equal) preference statements over the values of a set of variables, and it suits mul- tiple attributes qualitative decision making under incomplete preference information situation especially. Firstly,by con- structing induced graph of CP-nets and studying its properties, it was found that the nature of strong dominance testing is accessibility between vertices on the induced graph. So the problem of strong dominance testing with respect to bina- ry-valued CP-nets is solved by DFS algorithm. Secondly, the consistency for CP-nets was studied. The theorems and properties on consistency were given separately from the perspective of acyclic CP-nets and cyclic CP-nets. In particu- lar, three methods on judgment of consistency were proposed. All these can be seen as the improvement and refinement of I3outilier's related works.