Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10491)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: SAT 2017.
Buy print copy
About this book
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.
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.
Similar content being viewed by others
Keywords
- artificial intelligence
- computer architecture
- computer software selection and evaluation
- constraint theory
- formal logic
- formal methods
- formal verifications
- genetic algorithms
- learning algorithms
- learning systems
- machine learning
- model checking
- problem solving
- program processors
- sat solvers
- satisfiability
- semantics
- software engineering
- theorem proving
- verification
Table of contents (30 papers)
-
Front Matter
-
Algorithms, Complexity, and Lower Bounds
-
Front Matter
-
-
Clause Learning and Symmetry Handling
-
Front Matter
-
-
Maximum Satisfiability and Minimal Correction Sets
-
Front Matter
-
-
Parallel SAT Solving
-
Front Matter
-
Other volumes
-
Theory and Applications of Satisfiability Testing – SAT 2017
Editors and Affiliations
Bibliographic Information
Book Title: Theory and Applications of Satisfiability Testing – SAT 2017
Book Subtitle: 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings
Editors: Serge Gaspers, Toby Walsh
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-66263-3
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
Softcover ISBN: 978-3-319-66262-6Published: 09 August 2017
eBook ISBN: 978-3-319-66263-3Published: 14 August 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 476
Number of Illustrations: 68 b/w illustrations
Topics: Theory of Computation, Artificial Intelligence, Software Engineering, Operating Systems, Computer Systems Organization and Communication Networks, Numeric Computing