Theory and Applications of Satisfiability Testing – SAT 2018 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings /
Theory and Applications of Satisfiability Testing – SAT 2018 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings / [electronic resource] :
edited by Olaf Beyersdorff, Christoph M. Wintersteiger.
- 1st ed. 2018.
- XIX, 452 p. 73 illus. online resource.
- Theoretical Computer Science and General Issues, 10929 2512-2029 ; .
- Theoretical Computer Science and General Issues, 10929 .
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.
9783319941448
10.1007/978-3-319-94144-8 doi
Computer science.
Artificial intelligence.
Software engineering.
Computer programming.
Computer science--Mathematics.
Discrete mathematics.
Artificial intelligence--Data processing.
Theory of Computation.
Artificial Intelligence.
Software Engineering.
Programming Techniques.
Discrete Mathematics in Computer Science.
Data Science.
QA75.5-76.95
004.0151
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.
9783319941448
10.1007/978-3-319-94144-8 doi
Computer science.
Artificial intelligence.
Software engineering.
Computer programming.
Computer science--Mathematics.
Discrete mathematics.
Artificial intelligence--Data processing.
Theory of Computation.
Artificial Intelligence.
Software Engineering.
Programming Techniques.
Discrete Mathematics in Computer Science.
Data Science.
QA75.5-76.95
004.0151