Theory and Applications of Satisfiability Testing – SAT 2017 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings
Description
This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017.
The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.
The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.
Keywords
ComputersComputer ScienceArtificial IntelligenceSoftware Development & EngineeringOperating SystemsHardwareMathematicsNumerical AnalysisDiscrete MathematicsInformation Technology
2017Book
Author(s)Toby Walsh, Serge Gaspers
PublisherSpringer International Publishing
ISBN9783319662626
LanguageEnglish
