|
|
|
|
LEADER |
02141nmm a2200409 u 4500 |
001 |
EB001579210 |
003 |
EBX01000000000000000945670 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
170904 ||| eng |
020 |
|
|
|a 9783319662633
|
100 |
1 |
|
|a Gaspers, Serge
|e [editor]
|
245 |
0 |
0 |
|a Theory and Applications of Satisfiability Testing – SAT 2017
|h Elektronische Ressource
|b 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings
|c edited by Serge Gaspers, Toby Walsh
|
250 |
|
|
|a 1st ed. 2017
|
260 |
|
|
|a Cham
|b Springer International Publishing
|c 2017, 2017
|
300 |
|
|
|a XIII, 476 p. 68 illus
|b online resource
|
653 |
|
|
|a Operating Systems
|
653 |
|
|
|a Software engineering
|
653 |
|
|
|a Computer science
|
653 |
|
|
|a Numerical Analysis
|
653 |
|
|
|a Operating systems (Computers)
|
653 |
|
|
|a Software Engineering
|
653 |
|
|
|a Artificial Intelligence
|
653 |
|
|
|a Computer networks
|
653 |
|
|
|a Computer Engineering and Networks
|
653 |
|
|
|a Artificial intelligence
|
653 |
|
|
|a Numerical analysis
|
653 |
|
|
|a Computer engineering
|
653 |
|
|
|a Theory of Computation
|
700 |
1 |
|
|a Walsh, Toby
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
028 |
5 |
0 |
|a 10.1007/978-3-319-66263-3
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-66263-3?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 004.0151
|
520 |
|
|
|a 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
|