News

Proceedings?

Schedule?

Accepted Papers?

News

The most recent news regarding the SofT'10 workshop are available here.

Proceedings: Workshop proceedings are available here.

Workshop schedule

9:00 - 10:30

Emanuele Di Rosa, Enrico Giunchiglia and Barry O'Sullivan. Combining approaches for solving Satisfiability problems with Preferences and their Evaluation

Souhila Kaci and Cédric Piette. Ordering Intervals: From Qualitative Temporal Constraint Satisfaction Problems to Preference Representation

Stefano Bistarelli, Daniele Pirolandi and Francesco Santini. Argumentation-based Interactions among Agents: Solving Weighted and Bipolar Frameworks with Soft CSPs

10:30 - 11:00 coffee break

11:00 - 12:30

Felip Manya. A Report on the 2010 MaxSAT Evaluation.

Katsutoshi Hirayama, Daisuke Hatano and Yuta Sugimoto. Model Tracking for Dynamic SAT with Decision Change Costs

Ronen Brafman, Francesca Rossi, Domenico Salvagnin, K. Brent Venable and Toby Walsh. Finding the next solution in constraint- and preference-based knowledge representation formalisms

12:30 - 14:30 lunch

14:30 - 15:30

Lars Otten and Rina Dechter. Load Balancing for Parallel Branch and Bound

Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable and Toby Walsh. A local search approach to solve incomplete fuzzy and weighted CSPs

15:30 - 16:00 coffee break

16:00 - 17:00

Patricia Gutierrez and Pedro Meseguer. Enforcing Soft Local Consistency on Multiple Representations for DCOP Solving

Giorgio Dalla Pozza, Francesca Rossi and Kristen Brent Venable. Multi-agent soft constraint aggregation: a sequential approach

List of accepted papers

Emanuele Di Rosa, Enrico Giunchiglia and Barry O'Sullivan. Combining approaches for solving Satisfiability problems with Preferences and their Evaluation

Katsutoshi Hirayama, Daisuke Hatano and Yuta Sugimoto. Model Tracking for Dynamic SAT with Decision Change Costs

Patricia Gutierrez and Pedro Meseguer. Enforcing Soft Local Consistency on Multiple Representations for DCOP Solving

Rina Dechter and Lars Otten. Load Balancing for Parallel Branch and Bound

Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable and Toby Walsh. A local search approach to solve incomplete fuzzy and weighted CSPs

Giorgio Dalla Pozza, Francesca Rossi and Kristen Brent Venable. Multi-agent soft constraint aggregation: a sequential approach

Wady Naanaa. A decomposition method for valued CSPs

Souhila Kaci and Cédric Piette. Ordering Unordered Intervals: From Qualitative Constraint Satisfaction Problems to Preference Representation

Stefano Bistarelli, Daniele Pirolandi and Francesco Santini. Argumentation-based Interactions among Agents: Solving Weighted and Bipolar Frameworks with Soft CSPs

Ronen Brafman, Francesca Rossi, Domenico Salvagnin, K. Brent Venable and Toby Walsh. Finding the next solution in constraint- and preference-based knowledge representation formalisms

Description

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'10 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.

Format

The SofT'10 workshop is intended to build on the experience and success of the CP'99 to CP'08 workshops on the same subject and a 2008 t meeting on cost function processing. Its aim is to provide a forum where researchers currently working in this area can discuss their most recent ideas and developments and think together about the most promising new directions. Therefore, we encourage the presentation of work in progress or on specialized aspects of preferences, soft constraints, and more generally, cost function processing. Papers that bridge the gap between theory and practice are especially welcome.

Call for Papers

PDF and ASCII versions of the Call for Papers.