¡Esta es una revisión vieja del documento!


Soft Constraints

Constraint Satisfaction Problems (CSPs) often deal with preferences and other quantitative criteria. Such criteria are important as they provide information about the context of the problem that is not captured by the constraints model. Moreover, such criteria are fundamental in over-constrained problems where there are no solutions for the given CSPs. Soft constraints are then 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. This page summarizes our main results in this line and points out some future challenges.

Papers

tbd

Software

tbd

 
grupos/avispa/soft_constraints.1160572064.txt.gz · Ú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