Representation and realization of binary-valued CP-nets in directed tree

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 some notions and an example of CP-nets, we mainly introduce the realization for the class of binary-valued, tree-structured CP-nets, which is conducted on the basis of chain CP-nets. So we explain how to divide a tree-structured CP-net into chain CP-nets, how to represent and realize the chain CP-nets, and how to merge these sub-rankings derived from the chain CP-nets to generate the preference ranking of the tree-structured CP-net. At last, the corresponding analysis is carried out to prove its correctness.