1 option
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 / edited by Olaf Beyersdorff, Christoph M. Wintersteiger.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 10929
- Theoretical Computer Science and General Issues, 2512-2029 ; 10929
- Language:
- English
- Subjects (All):
- 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.
- Local Subjects:
- Theory of Computation.
- Artificial Intelligence.
- Software Engineering.
- Programming Techniques.
- Discrete Mathematics in Computer Science.
- Data Science.
- Physical Description:
- 1 online resource (XIX, 452 pages) : 73 illustrations
- Edition:
- 1st ed. 2018.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2018.
- System Details:
- text file PDF
- Summary:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-94144-8
- 9783319941448
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.