Skip to main content
SpringerLink
Log in

Theory and Applications of Satisfiability Testing – SAT 2020

23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Luca Pulina

    1. University of Sassari, Sassari, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Martina Seidl

    1. Johannes Kepler University of Linz, Linz, Austria

    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 12178)

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

Included in the following conference series:

Conference proceedings info: SAT 2020.

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

Access this book

Log in via an institution
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

Table of contents (36 papers)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Sorting Parity Encodings by Reusing Variables

    • Leroy Chew, Marijn J. H. Heule
    Pages 1-10

  3. Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving

    • Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Vijay Ganesh, Fabrice Kordon
    Pages 11-27

  4. Clause Size Reduction with all-UIP Learning

    • Nick Feng, Fahiem Bacchus
    Pages 28-45

  5. Trail Saving on Backtrack

    • Randy Hickey, Fahiem Bacchus
    Pages 46-61

  6. Four Flavors of Entailment

    • Sibylle Möhle, Roberto Sebastiani, Armin Biere
    Pages 62-71

  7. Designing New Phase Selection Heuristics

    • Arijit Shaw, Kuldeep S. Meel
    Pages 72-88

  8. On the Effect of Learned Clauses on Stochastic Local Search

    • Jan-Hendrik Lorenz, Florian Wörz
    Pages 89-106

  9. SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers

    • Gilles Audemard, Loïc Paulevé, Laurent Simon
    Pages 107-113

  10. Distributed Cube and Conquer with Paracooba

    • Maximilian Heisinger, Mathias Fleury, Armin Biere
    Pages 114-122

  11. Reproducible Efficient Parallel SAT Solving

    • Hidetomo Nabeshima, Katsumi Inoue
    Pages 123-138

  12. Improving Implementation of SAT Competitions 2017–2019 Winners

    • Stepan Kochemazov
    Pages 139-148

  13. On CDCL-Based Proof Systems with the Ordered Decision Strategy

    • Nathan Mull, Shuo Pang, Alexander Razborov
    Pages 149-165

  14. Equivalence Between Systems Stronger Than Resolution

    • Maria Luisa Bonet, Jordi Levy
    Pages 166-181

  15. Simplified and Improved Separations Between Regular and General Resolution by Lifting

    • Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström
    Pages 182-200

  16. Mycielski Graphs and PR Proofs

    • Emre Yolcu, Xinyu Wu, Marijn J. H. Heule
    Pages 201-217

  17. Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems

    • Javier Larrosa, Emma Rollon
    Pages 218-232

  18. Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers

    • Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi, Vijay Ganesh
    Pages 233-249

  19. On the Sparsity of XORs in Approximate Model Counting

    • Durgesh Agrawal, Bhavishya, Kuldeep S. Meel
    Pages 250-266

  20. A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

    • Friedrich Slivovsky, Stefan Szeider
    Pages 267-276
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2020

Keywords

About this book

This book constitutes the proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020, which was planned to take place in Alghero, Italy, during July 5-9, 2020. Due to the coronavirus COVID-19 pandemic, the conference was held virtually. 

The 25 full, 9 short, and 2 tool papers presented in this volume were carefully reviewed and selected from 69 submissions. They deal with 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 (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.

 

Editors and Affiliations

  • University of Sassari, Sassari, Italy

    Luca Pulina

  • Johannes Kepler University of Linz, Linz, Austria

    Martina Seidl

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation