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 f...
Carmel Domshlak, Steven David Prestwich, Francesca...
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
Alberto Delgado, Carlos Alberto Olarte, Jorge Andr...
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...