Workshop on Search Techniques for Constraint Satisfaction

Search is essential for solving combinatorial problems in AI. For the usual case where inference based methods are incomplete, search provides the core engine for applications such as hardware verification, planning, or protein folding.

Recent advances in Constraint Programming (CP) and Boolean algorithms for Propositional Satisfiability (SAT), Pseudo-Boolean Optimization (PBO), Satisfiability-Modulo Theories (SMT) and Quantified Boolean Formulas (QBF) have allowed current solvers to perform several orders of magnitude faster than previous ones. This workshop aims at bringing together researchers and practitioners from these communities, in order to learn from each other, develop common understandings, and inspire new applications, algorithms and approaches.

Topics of Interest

The topics of the workshop span practical and theoretical research on search techniques for constraint satisfaction and include but are not limited to:

- Complete and local search algorithms
- Analysis of search algorithms
- Search heuristics
- Search space pruning techniques
- Problem encodings for combinatorial problems using constraint programming and propositional satisfiability
- Novel applications using constraint satisfaction components
- Implementation techniques for constraint satisfaction and combinatorial optimization search algorithms
- Distributed and parallel algorithms for constraint satisfaction
- Case studies and empirical results

Scope

Recent advances in Constraint Programming (CP) and Boolean algorithms for Propositional Satisfiability (SAT), Pseudo-Boolean Optimization (PBO), Satisfiability-Modulo Theories (SMT) and Quantified Boolean Formulas (QBF) have allowed current state of the art solvers to perform several orders of magnitude faster than previous ones. Moreover, international solver competitions and evaluations increased the interest of several industries in these solvers.

At the workshop, we expect new contributions to constraint satisfaction search algorithms, as well as applications of current methods in solving real world problems. Moreover, we also expect the presentation of novel problem encodings for combinatorial problems, including relevant techniques such as symmetry breaking. Finally, presentation of new implementation techniques are also expected.

Organising Committee

Name Francisco Azevedo
Postal Address FCT/UNL Departamento de Informatica, Quinta da Torre,
2829-516 Caparica
Telephone and Fax +351 212948300 (Ext. 10730) +351 212948541
Email Este endereço de email está protegido contra spam bots, pelo que o Javascript terá de estar activado para poder visualizar o endereço de email

Name Ines Lynce
Postal Address IST/UTL INESC-ID, Rua Alves Redol, 9, 1000-029 Lisboa
Telephone and Fax +351 213100290 +351 213145843
Email Este endereço de email está protegido contra spam bots, pelo que o Javascript terá de estar activado para poder visualizar o endereço de email

Name Vasco Manquinho
Postal Address IST/UTL INESC-ID, Rua Alves Redol, 9, 1000-029 Lisboa
Telephone and Fax +351 213100204 +351 213145843
Email Este endereço de email está protegido contra spam bots, pelo que o Javascript terá de estar activado para poder visualizar o endereço de email  

Program Committee

Pedro Barahona, Universidade Nova de Lisboa, Portugal
Lucas Bordeaux, Microsoft Research, UK
Carla Gomes, Cornell University, USA
Zeynep Kiziltan, Università di Bologna, Italy
Oliver Kullmann, University of Wales Swansea, UK
Daniel Le Berre, Université d'Artois, France
Felip Manyà, Universitat de Lleida, Spain
João Marques-Silva, University of Southampton, UK
Pedro Meseguer, IIIA-CSIC Barcelona, Spain
Steven Prestwich, University College Cork, Ireland
Olivier Roussel, Université d'Artois, France
Carsten Sinz, University of Tübingen, Germany
Barbara Smith, Cork Constraint Computation Centre, Ireland
Armando Tachella, Università di Genova, Italy
Mark Wallace, Monash University, Australia