Sciweavers

Share
HEURISTICS
2006

Hard and soft constraints for reasoning about qualitative conditional preferences

8 years 10 months ago
Hard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP-nets model. In particular, we show how hard constraints are sufficient to model the optimal outcomes of a possibly cyclic CP-net, and how soft constraints can faithfully approximate the semantics of acyclic conditional preference statements whilst improving the computational efficiency of reasoning about these statements.
Carmel Domshlak, Steven David Prestwich, Francesca
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where HEURISTICS
Authors Carmel Domshlak, Steven David Prestwich, Francesca Rossi, Kristen Brent Venable, Toby Walsh
Comments (0)
books