Soft Constraints

Constraint Satisfaction Problems (CSPs) often deal with quantitative criteria such as preferences. Such criteria are important as they provide information about the context of the problem that is not captured by the constraints model. Such additional information could be fundamental in finding good solutions. Moreover, quantitative criteria are fundamental in over-constrained problems where there is no solution that respects all the constraints stated in the given CSP. Soft constraints are one way of dealing with these kinds of situations and obtaining approximate solutions. The AVISPA research group has been working on the integration of efficient soft constraints mechanisms in Mozart. Our focus has been the study and implementation of formal frameworks for soft constraints. This page summarizes our main results in this line and points out some future challenges.

Papers

tbd

Software

tbd

 
grupos/avispa/soft_constraints.txt · Última modificación: 2011/01/24 15:30 (editor externo)
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki