|
|
|
|
| LEADER |
02617nmm a2200409 u 4500 |
| 001 |
EB001841026 |
| 003 |
EBX01000000000000001005015 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
180702 ||| eng |
| 020 |
|
|
|a 9783319941448
|
| 100 |
1 |
|
|a Beyersdorff, Olaf
|e [editor]
|
| 245 |
0 |
0 |
|a Theory and Applications of Satisfiability Testing – SAT 2018
|h Elektronische Ressource
|b 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings
|c edited by Olaf Beyersdorff, Christoph M. Wintersteiger
|
| 250 |
|
|
|a 1st ed. 2018
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2018, 2018
|
| 300 |
|
|
|a XIX, 452 p. 73 illus
|b online resource
|
| 653 |
|
|
|a Artificial intelligence / Data processing
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Data Science
|
| 700 |
1 |
|
|a Wintersteiger, Christoph M.
|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-94144-8
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-94144-8?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018. The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications
|