Emmanuel Hebrard, Barry O’Sullivan, Toby Walsh
Users can often naturally express their preferences in terms of ideal or non-ideal solutions. We show how to reason about logical combinations of distance constraints on ideals and non-ideals using a novel global constraint. We evaluate our approach on both randomly generated and real-world configuration problem instances.
Subjects: 15.2 Constraint Satisfactionn
Submitted: Oct 15, 2006