Comparison of weighting judgments in multiattribute utility measurement
Management Science
Lisp and Symbolic Computation
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Preference-based search and multi-criteria optimization
Eighteenth national conference on Artificial intelligence
Backjump-Based Techniques versus Conflict-Directed Heuristics
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Multicriteria Optimization
An Efficient Upper Approximation for Conditional Preference
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Extending CP-nets with stronger conditional preference statements
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
On graphical modeling of preference and importance
Journal of Artificial Intelligence Research
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Look-ahead value ordering for constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
The computational complexity of dominance and consistency in CP-nets
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning with conditional ceteris paribus preference statements
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Introducing variable importance tradeoffs into CP-nets
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Conditional lexicographic orders in constraint satisfaction problems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
On solving Boolean multilevel optimization problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Computational techniques for a simple theory of conditional preferences
Artificial Intelligence
Boolean lexicographic optimization: algorithms & applications
Annals of Mathematics and Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two are easily distinguished conceptually and for purposes of problem solving. Preferences are represented as a lexicographic order over complete assignments based on variable importance and rankings of values in each domain. Feasibility constraints are treated in the usual manner. Since the preference representation is ordinal in character, these problems can be solved with algorithms that do not require evaluations to be represented explicitly. This includes ordinary CSP algorithms, although these cannot stop searching until all solutions have been checked, with the important exception of heuristics that follow the preference order (lexical variable and value ordering). We describe relations between lexicographic CSPs and more general soft constraint formalisms and show how a full lexicographic ordering can be expressed in the latter. We discuss relations with (T)CP-nets, highlighting the advantages of the present formulation, and we discuss the use of lexicographic ordering in multiobjective optimisation. We also consider strengths and limitations of this form of representation with respect to expressiveness and usability. We then show how the simple structure of lexicographic CSPs can support specialised algorithms: a branch and bound algorithm with an implicit cost function, and an iterative algorithm that obtains optimal values for successive variables in the importance ordering, both of which can be combined with appropriate variable ordering heuristics to improve performance. We show experimentally that with these procedures a variety of problems can be solved efficiently, including some for which the basic lexically ordered search is infeasible in practice.