Shop the Archives and get your next eBook for just 14.99! Stock up today >>

Theoretical Computer Science and General Issues

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

Editors: Beyersdorff, Olaf, Wintersteiger, Christoph M. (Eds.)

Buy this book

eBook £51.99
price for United Kingdom (gross)
  • ISBN 978-3-319-94144-8
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover £64.99
price for United Kingdom (gross)
  • ISBN 978-3-319-94143-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (27 chapters)

  • Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications

    Scholl, Christoph (et al.)

    Pages 3-16

  • Approximately Propagation Complete and Conflict Propagating Constraint Encodings

    Ehlers, Rüdiger (et al.)

    Pages 19-36

  • Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT

    Paxian, Tobias (et al.)

    Pages 37-53

  • Solving MaxSAT with Bit-Vector Optimization

    Nadel, Alexander

    Pages 54-72

  • Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers

    Elffers, Jan (et al.)

    Pages 75-93

Buy this book

eBook £51.99
price for United Kingdom (gross)
  • ISBN 978-3-319-94144-8
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover £64.99
price for United Kingdom (gross)
  • ISBN 978-3-319-94143-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Theory and Applications of Satisfiability Testing – SAT 2018
Book Subtitle
21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings
Editors
  • Olaf Beyersdorff
  • Christoph M. Wintersteiger
Series Title
Theoretical Computer Science and General Issues
Series Volume
10929
Copyright
2018
Publisher
Springer International Publishing
Copyright Holder
Springer International Publishing AG, part of Springer Nature
eBook ISBN
978-3-319-94144-8
DOI
10.1007/978-3-319-94144-8
Softcover ISBN
978-3-319-94143-1
Edition Number
1
Number of Pages
XIX, 452
Number of Illustrations and Tables
73 b/w illustrations
Topics