The topics of the conference span practical and theoretical research on SAT and its applications and include but are not limited to:
SAT is interpreted in a broad sense: besides propositional satisfiability, it includes the domains of pseudo-Boolean constraint solving and optimization (PB), quantified boolean formulae (QBF), constraint programming techniques (CSP) for word-level problems and their propositional encoding, satisfiability modulo theories (SMT), model counting and MAX SAT.
There are five workshops (and three competitions) affiliated with SAT’10:
PPC10 |
|
POS-10 |
|
LoCoCo 2010 |
|
SMT 2010 |
International Workshop on Satisfiability Modulo Theories (with CAV) |
LaSh 2010 |
3rd International Workshop on Logic and Search (with ICLP) |
For more details see the affiliated events' web-page .
The organizer of SAT's affiliated events is Carsten Sinz.
We are grateful for the sponsorship of:
Intel, the
Intel logo are trademarks or registered trademarks of Intel Corporation or its
subsidiaries in the United States and other Countries