A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Efficient Inference for Expressive Comparative Preference Languages
International Joint Conference on Artificial Intelligence
A fundamental task for reasoning with preferences is the following: given input preference information from a user, and outcomes α and β, should we infer that the user will prefer α to β? For CP-nets and related comparative preference formalisms, inferring a preference of α over β using the standard definition of derived preference appears to be extremely hard, and has been proved to be PSPACEcomplete in general for CP-nets. Such inference is also rather conservative, only making the assumptiondblp:conf/ijcai/Wilson09 fatcat:23qpr4fy35fdtjxpjgc3h4qlz4