Springer
BarcelonaSpainJuly 5-92021Proceedings
This book is printed on demand and is non-refundable after purchase
Available Formats :
Printed Book
It will be sent to your address
The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint programming (CP) for problems with clear connections to Boolean reasoning.
Report an issue with this product.