Theory and Applications of Satisfiability Testing -- SAT 2015

18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings

Buch | Softcover

XIX, 436 Seiten

2015 | 1st ed. 2015
Springer International Publishing (Verlag)
978-3-319-24317-7 (ISBN)

Artikel merken

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.

Erscheinungsdatum	08.10.2016
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XIX, 436 p. 94 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Software Entwicklung ► Qualität / Testen
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	analysis of algorithms • Applications • Boolean optimization • Combinatorial theory of satisfiability • Computational Complexity • Computer Science • conference proceedings • Constraint Programming • Exact and parameterized algorithms • formal methods • Informatics • Logic • MaxSAT • proof complexity • proof systems • propositional satisfiability problem • QBF • quantified Boolean formulas • Random instances • Research • SAT • satisfiability modulo theories • SAT solvers • Search algorithms and heuristics • SMT • Theory of Computation
ISBN-10	3-319-24317-9 / 3319243179
ISBN-13	978-3-319-24317-7 / 9783319243177
Zustand	Neuware