場所：国立情報学研究所(NII) 20階ミーティングルーム(2009/2010) （地図）
お問い合わせ：加藤 弘之 (kato_AT_nii.ac.jp)_AT_を＠に書き換えてください。
Prof. Toby Walsh（NICTA and University of the New South Wales）
=== Title ===
What can we do in SAT?
=== Abstract ===
SAT solvers have matured into a powerful turn key technology for solving a wide range of combinatorial problems. In this talk, I look at what we can and cannot do effectively in SAT. The talk explores in addition the connections between SAT and Constraint Satisfaction. The focus of the talk is on global constraints like AllDifferent. These are one of the key distinguishing features of constraint programming. I describe recent work on simulating the actions of global constraints with simple decompositions that can be implemented using SAT clauses or ILP models. Based on powerful lower bounds from circuit complexity,
I argue that there are, however, some things that cannot be effectively simulated in SAT. The conclusion is that not everything can be done in SAT and we do in fact need some of the powerful algorithmic techniques provided by Constraint Satisfaction.