
The 26 revised full papers presented together with 11 revised short papers presented together with 2 invited talks were carefully selected from 95 submissions. All current research issues in propositional and quantified Boolean formula satisfiability testing are covered; the papers are organized in topical sections on proofs and cores, heuristics and algorithms, applications, SMT, structure, MAX-SAT, local search and survey propagation, QBF, as well as counting and concurrency.
| h a abbass a a bronson james j cramer demaerel ph bergant dianne ca | jennifer lisa koslow dan coughlan raj k bansal terry o neil audrey niffenegger |