iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-319-94144-8
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 | SpringerLink
Skip to main content
Springer Nature Link
Log in

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

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Olaf Beyersdorff

    1. Friedrich Schiller University Jena, Jena, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Christoph M. Wintersteiger

    1. Microsoft Research Ltd., Cambridge, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10929)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SAT 2018.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Keywords

Table of contents (27 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter PDF

  2. Invited Talk

    1. Front Matter

      Pages 1-1
      Download chapter PDF

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

      • Christoph Scholl, Ralf Wimmer
      Pages 3-16

  3. Maximum Satisfiability

    1. Front Matter

      Pages 17-17
      Download chapter PDF

    2. Approximately Propagation Complete and Conflict Propagating Constraint Encodings

      • Rüdiger Ehlers, Francisco Palau Romero
      Pages 19-36

    3. Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT

      • Tobias Paxian, Sven Reimer, Bernd Becker
      Pages 37-53

    4. Solving MaxSAT with Bit-Vector Optimization

      • Alexander Nadel
      Pages 54-72

  4. Conflict Driven Clause Learning

    1. Front Matter

      Pages 73-73
      Download chapter PDF

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

      • Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals
      Pages 75-93

    3. Machine Learning-Based Restart Policy for CDCL SAT Solvers

      • Jia Hui Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh
      Pages 94-110

    4. Chronological Backtracking

      • Alexander Nadel, Vadim Ryvchin
      Pages 111-121

    5. Centrality-Based Improvements to CDCL Heuristics

      • Sima Jamali, David Mitchell
      Pages 122-131

  5. Model Counting

    1. Front Matter

      Pages 133-133
      Download chapter PDF

    2. Fast Sampling of Perfectly Uniform Satisfying Assignments

      • Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos
      Pages 135-147

    3. Fast and Flexible Probabilistic Model Counting

      • Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos
      Pages 148-164

    4. Exploiting Treewidth for Projected Model Counting and Its Limits

      • Johannes K. Fichte, Markus Hecher, Michael Morak, Stefan Woltran
      Pages 165-184

  6. Quantified Boolean Formulae

    1. Front Matter

      Pages 185-185
      Download chapter PDF

    2. Circuit-Based Search Space Pruning in QBF

      • Mikoláš Janota
      Pages 187-198

    3. Symmetries of Quantified Boolean Formulas

      • Manuel Kauers, Martina Seidl
      Pages 199-216

    4. Local Soundness for QBF Calculi

      • Martin Suda, Bernhard Gleiss
      Pages 217-234
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2018

Editors and Affiliations

  • Friedrich Schiller University Jena, Jena, Germany

    Olaf Beyersdorff

  • Microsoft Research Ltd., Cambridge, United Kingdom

    Christoph M. Wintersteiger

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation