Theory and Applications of Satisfiability Testing - SAT 2017 [electronic resource] : 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings / edited by Serge Gaspers, Toby Walsh.
Contributor(s): Gaspers, Serge [editor.]
| Walsh, Toby [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 10491Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Edition: 1st ed. 2017.Description: XIII, 476 p. 68 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319662633.Subject(s): Computer science | Artificial intelligence | Software engineering | Operating systems (Computers) | Computer engineering | Computer networks | Numerical analysis | Theory of Computation | Artificial Intelligence | Software Engineering | Operating Systems | Computer Engineering and Networks | Numerical AnalysisAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.
There are no comments for this item.