Sciweavers

Share
IJCAI
2003

Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

9 years 1 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all three kinds of information. We therefore propose a framework, based on both CP-nets and soft constraints, that handles both hard and soft constraints as well as conditional preferences efficiently and uniformly. We study the complexity of testing the consistency of preference statements, and show how soft constraints can faithfully approximate the semantics of conditional preference statements whilst improving the computational complexity.
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where IJCAI
Authors Carmel Domshlak, Francesca Rossi, Kristen Brent Venable, Toby Walsh
Comments (0)
books