Theory and Applications of Satisfiability Testing -- SAT 2015 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings / [electronic resource] :
edited by Marijn Heule, Sean Weaver.
- 1st ed. 2015.
- XIX, 436 p. 94 illus. in color. online resource.
- Theoretical Computer Science and General Issues ; Lecture Notes in Computer Science 9340 9340 .
- Theoretical Computer Science and General Issues ; 9340 Lecture Notes in Computer Science ; 9340 .
This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (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, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation. The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.
9783319243184
10.1007/978-3-319-24318-4 doi
Computers.
Artificial intelligence.
Computer science—Mathematics.
Theory of Computation.
Artificial Intelligence.
Mathematics of Computing.
QA75.5-76.95 QA76.63
004.0151
This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (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, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation. The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.
9783319243184
10.1007/978-3-319-24318-4 doi
Computers.
Artificial intelligence.
Computer science—Mathematics.
Theory of Computation.
Artificial Intelligence.
Mathematics of Computing.
QA75.5-76.95 QA76.63
004.0151