Theory and Applications of Satisfiability Testing - SAT 2017  20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings /  [electronic resource] : 
edited by Serge Gaspers, Toby Walsh. 
 - 1st ed. 2017. 
 - XIII, 476 p. 68 illus.  online resource. 
 - Theoretical Computer Science and General Issues,  10491  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  10491 .
<br/><br/> 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. 
<br/><br/><label>ISBN: </label>9783319662633 
<br/><br/><label>Standard No.: </label>10.1007/978-3-319-66263-3  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science.<br/>Artificial intelligence.<br/>Software engineering.<br/>Operating systems (Computers).<br/>Computer engineering.<br/>Computer networks .<br/>Numerical analysis.<br/>Theory of Computation.<br/>Artificial Intelligence.<br/>Software Engineering.<br/>Operating Systems.<br/>Computer Engineering and Networks.<br/>Numerical Analysis.
<br/><br/><label>LC Class. No.: </label>QA75.5-76.95 
<br/><br/><label>Dewey Class. No.: </label>004.0151