Abstract
CP-nets (conditional preference networks) are a graphical model for compactly expressing conditional ceteris paribus (all other things being equal) preference statements on multi-attribute domains. In this paper, we investigate the expressive efficiency of two kinds of binary-valued CP-nets, the first kind is set-structured CP-nets, and the second kind is equal difference CP-nets. For the first kind, we prove that it can express 3n-2n preference relations with n preference rules, and has an expressive efficiency of (3n-2n)/n. For the second kind, we show that it can express a total order of 2n-1∗(2n-1) preference relations with 2n-1 preference rules, and has an expressive efficiency of 2n-1. For the future research, we propose an open problem: given an acyclic CP-net N with the in-degree sequence of (d1,d2,…,dn), how many preference relations can be expressed by N?
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
