Welcome to the 11th Workshop on Preferences
and Soft Constraints (SofT 2011)

Preferences are ubiquitous in real life: most problems are over-constrained and would not be solvable if we insist that all their requirements are strictly met. Moreover, many problems are more naturally described via preferences rather than hard statements. Soft constraints are the way the constraint community has extended its classical framework to deal with the concept of preferences.
The SofT'11 workshop will bring together researchers interested in all aspects of soft constraints and cost function processing, such as:

    * theoretical frameworks
    * problem modeling
    * solving algorithms
    * languages
    * preference aggregation and elicitation
    * multi-objective or qualitative optimization
    * combining/integrating different frameworks and algorithms
    * comparative studies
    * real-life applications

The workshop is an opportunity to share knowledge between people working around algorithms and solvers for different formalisms, including Weighted Max-SAT, Soft CSP, Bayesian Networks, Random Markov Field, Factor Graphs, Pseudo Boolean Optimization, SAT Modulo Theories, and related formalisms.

The 11th edition will take place in Perugia, Italy the 12th of September 2011