Qualitative Preference Decision and Reasoning of Consistency for CP-nets
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.