An efficient upper approximation for conditional preference
Loading...
Files
Published version
Date
2006-06
Authors
Wilson, Nic
Journal Title
Journal ISSN
Volume Title
Publisher
IOS Press
Published Version
Abstract
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative conditional preferences such as CP-nets and conditional preference theories (CP-theories). It is therefore natural to consider approximations of preference, and upper approximations are of particular interest, since they can be used within a constraint optimisation algorithm to find some of the optimal solutions. Upper approximations for preference in CP-theories have previously been suggested, but they require consistency, as well as strong acyclicity conditions on the variables. We define an upper approximation of conditional preference for which dominance checking is efficient, and which can be applied very generally for CP-theories.
Description
Keywords
Dominance testing , CP-nets , Conditional preference theories (CP-theories) , Reasoning , Constraints , Constraint computing , AI , Artificial intelligence
Citation
Wilson, N. (2006) 'An Efficient Upper Approximation for Conditional Preference' European Conference on Artificial Intelligence (ECAI 2006), Riva del Garda, Trentino, Italy, 29 Aug - 1 Sept, pp. 472-476.