Skip to main content
SpringerLink
Log in

Theory and Applications of Satisfiability Testing – SAT 2019

22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Mikoláš Janota

    1. University of Lisbon, Lisbon, Portugal

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Inês Lynce

    1. University of Lisbon, Lisbon, Portugal

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

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

Included in the following conference series:

Conference proceedings info: SAT 2019.

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 (28 papers)

  1. Front Matter

    Pages i-xiv
    Download chapter PDF

  2. Circular (Yet Sound) Proofs

    • Albert Atserias, Massimo Lauria
    Pages 1-18

  3. Short Proofs in QBF Expansion

    • Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan
    Pages 19-35

  4. Proof Complexity of QBF Symmetry Recomputation

    • Joshua Blinkhorn, Olaf Beyersdorff
    Pages 36-52

  5. Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model

    • Oleksii Omelchenko, Andrei A. Bulatov
    Pages 53-70

  6. DRAT Proofs, Propagation Redundancy, and Extended Resolution

    • Sam Buss, Neil Thapen
    Pages 71-89

  7. Knowledge Compilation Languages as Proof Systems

    • Florent Capelli
    Pages 90-99

  8. The Equivalences of Refutational QRAT

    • Leroy Chew, Judith Clymo
    Pages 100-116

  9. A SAT-Based System for Consistent Query Answering

    • Akhil A. Dixit, Phokion G. Kolaitis
    Pages 117-135

  10. Incremental Inprocessing in SAT Solving

    • Katalin Fazekas, Armin Biere, Christoph Scholl
    Pages 136-154

  11. Local Search for Fast Matrix Multiplication

    • Marijn J. H. Heule, Manuel Kauers, Martina Seidl
    Pages 155-163

  12. Speeding Up Assumption-Based SAT

    • Randy Hickey, Fahiem Bacchus
    Pages 164-182

  13. Simplifying CDCL Clause Database Reduction

    • Sima Jamali, David Mitchell
    Pages 183-192

  14. QRAT Polynomially Simulates \(\forall \text {-Exp+Res}\)

    • Benjamin Kiesl, Martina Seidl
    Pages 193-202

  15. QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties

    • Florian Lonsing, Uwe Egly
    Pages 203-210

  16. On Computing the Union of MUSes

    • Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, Joao Marques-Silva
    Pages 211-221

  17. Revisiting Graph Width Measures for CNF-Encodings

    • Stefan Mengel, Romain Wallon
    Pages 222-238

  18. DRMaxSAT with MaxHS: First Contact

    • Antonio Morgado, Alexey Ignatiev, Maria Luisa Bonet, Joao Marques-Silva, Sam Buss
    Pages 239-249

  19. Backing Backtracking

    • Sibylle Möhle, Armin Biere
    Pages 250-266

  20. Assessing Heuristic Machine Learning Explanations with Model Counting

    • Nina Narodytska, Aditya Shrotri, Kuldeep S. Meel, Alexey Ignatiev, Joao Marques-Silva
    Pages 267-278
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing – SAT 2019

Keywords

About this book

This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019.

The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) 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 Lisbon, Lisbon, Portugal

    Mikoláš Janota, Inês Lynce

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation