Theory And Applications Of Satisfiability Testing Sat 2018 (lecture Notes In Computer Science)
by Olaf Beyersdorff /
2018 / English / PDF
12.8 MB Download
This book constitutes the refereed proceedings of the 21st InternationalConference on Theory and Applications of Satisfiability Testing, SAT2018, held in Oxford, UK, in July 2018.
The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers addressdifferent aspects ofSAT interpreted in a broad sense, including theoreticaladvances (such as exact algorithms, proof complexity, and other complexity issues),practical search algorithms, knowledge compilation, implementation-leveldetails of SAT solvers and SAT-based systems, problem encodings and reformulations,applications as well ascase studies and reports on findings based onrigorous experimentation. They are organized in the following topical sections: maximum satisfiability conflict driven clause learning model counting quantified Boolean formulae theory minimally unsatisfiable sets satisfiability modulo theories and tools and applications.
