STCS |
Workshop on Search Techniques for Constraint SatisfactionSearch 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 InterestThe topics of the workshop span practical and theoretical research on search techniques for constraint satisfaction and include but are not limited to:
ScopeRecent 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 CommitteeName Francisco Azevedo Program CommitteePedro Barahona, Universidade Nova de Lisboa, Portugal |