Theory and Applications of Satisfiability Testing -- SAT 2015 electronic resource 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings / edited by Marijn Heule, Sean Weaver.
Material type:
TextSeries: Lecture Notes in Computer SciencePublication details: Cham : Springer International Publishing : Imprint: Springer, 2015Edition: 1st ed. 2015Description: XX, 436 p. 94 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319243184Subject(s): Computer Science | computers | Computer science -- Mathematics | Artificial intelligence | Computer Science | Theory of Computation | Artificial Intelligence (incl. Robotics) | Mathematics of ComputingDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
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.
There are no comments on this title.