Research on Algorithm of Satisfiability Ranking Generation for CP-nets
Sun Xue-jia · 2015
CP-nets(condition preference networks)is a simple and intuitive graphical tool for representing conditional ceteris paribus preference statements over the values of a set of variables,and it has been a studying hotspot in artificial intelligence recently.The satisfiability ranking of CP-nets is studied.By constructing induced graph of CP-nets and solving the strong dominance testing with respect to binary-valued CP-nets,the number of satisfiability ranking was derived.And the algorithm of generating all satisfiability rankings was designed by analyzing the reachability matrix acquired from strong dominance testing.What's more,the syntax,semantics and some definitions were collated and introduced.