Representation and realization of binary-valued CP-nets in single-branch tree

CP-Nets: CP-nets (Condition Preference Nets) is a tool for representing and reasoning with condition ceteris paribus preference statements put forward by Craig Boutilier, but how to represent and realize is not given. In this paper, after introducing some notions and an example of CP-nets, we adopt binary list as a storage structure to represent and store CPTs, and devise an algorithm for ranking outcomes in the class of binary-valued, single-branch tree-structured CP-nets. On the basis of preference ranking, the optimal outcome and dominance queries can be generated. Then, corresponding analysis of the algorithm is carried out to prove its correctness.