Skip to main content
SpringerLink
Log in

Theory and Applications of Satisfiability Testing – SAT 2021

24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Chu-Min Li

    1. Laboratoire MIS, University of Picardie Jules Verne, Amiens, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Felip Manyà

    1. IIIA-CSIC, Spanish National Research Council (CSIC), Bellaterra, Spain

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

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

Included in the following conference series:

Conference proceedings info: SAT 2021.

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 119.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 (37 papers)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. OptiLog: A Framework for SAT-based Systems

    • Carlos Ansótegui, Jesús Ojeda, Antonio Pacheco, Josep Pon, Josep M. Salvia, Eduard Torres
    Pages 1-10

  3. PyDGGA: Distributed GGA for Automatic Configuration

    • Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney
    Pages 11-20

  4. QBFFam: A Tool for Generating QBF Families from Proof Complexity

    • Olaf Beyersdorff, Luca Pulina, Martina Seidl, Ankit Shukla
    Pages 21-29

  5. Davis and Putnam Meet Henkin: Solving DQBF with Resolution

    • Joshua Blinkhorn, Tomáš Peitl, Friedrich Slivovsky
    Pages 30-46

  6. Lower Bounds for QCDCL via Formula Gauge

    • Benjamin Böhm, Olaf Beyersdorff
    Pages 47-63

  7. Deep Cooperation of CDCL and Local Search for SAT

    • Shaowei Cai, Xindi Zhang
    Pages 64-81

  8. Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers

    • Henrik Cao
    Pages 82-97

  9. Hardness and Optimality in QBF Proof Systems Modulo NP

    • Leroy Chew
    Pages 98-115

  10. Characterizing Tseitin-Formulas with Short Regular Resolution Refutations

    • Alexis de Colnet, Stefan Mengel
    Pages 116-133

  11. Weighted Model Counting Without Parameter Variables

    • Paulius Dilkas, Vaishak Belle
    Pages 134-151

  12. ProCount: Weighted Projected Model Counting with Graded Project-Join Trees

    • Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi
    Pages 152-170

  13. Efficient All-UIP Learned Clause Minimization

    • Mathias Fleury, Armin Biere
    Pages 171-187

  14. Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily

    • Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton
    Pages 188-206

  15. MCP: Capturing Big Data by Satisfiability (Tool Description)

    • Miki Hermann, Gernot Salzer
    Pages 207-215

  16. Chinese Remainder Encoding for Hamiltonian Cycles

    • Marijn J. H. Heule
    Pages 216-224

  17. Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5

    • Pei Huang, Rundong Li, Minghao Liu, Feifei Ma, Jian Zhang
    Pages 225-241

  18. DiMo – Discrete Modelling Using Propositional Logic

    • Norbert Hundeshagen, Martin Lange, Georg Siebert
    Pages 242-250

  19. SAT-Based Rigorous Explanations for Decision Lists

    • Alexey Ignatiev, Joao Marques-Silva
    Pages 251-269

  20. Investigating the Existence of Costas Latin Squares via Satisfiability Testing

    • Jiwei Jin, Yiqi Lv, Cunjing Ge, Feifei Ma, Jian Zhang
    Pages 270-279
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2021

Keywords

About this book

This book constitutes the proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021, which took place in Barcelona, Spain, in July 2021.

The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint programming (CP) for problems with clear connections to Boolean reasoning.

Editors and Affiliations

  • Laboratoire MIS, University of Picardie Jules Verne, Amiens, France

    Chu-Min Li

  • IIIA-CSIC, Spanish National Research Council (CSIC), Bellaterra, Spain

    Felip Manyà

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation