Generating Extended Resolution Proofs with a BDD-Based SAT Solver-Reference-Cited by-同舟云学术

Generating Extended Resolution Proofs with a BDD-Based SAT Solver

Published:2023-07-25 Issue:4 Volume:24 Page:1-28
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Bryant Randal E.¹^ORCID,Heule Marijn J. H.¹^ORCID

Affiliation:

1. Carnegie Mellon University, USA

Abstract

In 2006, Biere, Jussila, and Sinz made the key observation that the underlying logic behind algorithms for constructing Reduced, Ordered Binary Decision Diagrams (BDDs) can be encoded as steps in a proof in the extended resolution logical framework. Through this, a BDD-based Boolean satisfiability (SAT) solver can generate a checkable proof of unsatisfiability. Such a proof indicates that the formula is truly unsatisfiable without requiring the user to trust the BDD package or the SAT solver built on top of it. We extend their work to enable arbitrary existential quantification of the formula variables, a critical capability for BDD-based SAT solvers. We demonstrate the utility of this approach by applying a BDD-based solver, implemented by extending an existing BDD package, to several challenging Boolean satisfiability problems. Our results demonstrate scaling for parity formulas as well as the Urquhart, mutilated chessboard, and pigeonhole problems far beyond that of other proof-generating SAT solvers.

Funder

U.S. National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3595295

Reference52 articles.

1. Mutilated chessboard problem is exponentially hard for resolution

2. Henrik Reif Andersen. 1997. An Introduction to Binary Decision Diagrams. Technical Report. Technical University of Denmark.

3. Armin Biere. 2019. CaDiCaL at the SAT Race 2019. In Proc. of SAT Race 2019 – Solver and Benchmark Descriptions (Department of Computer Science Series of Publications B), Vol. B-2019-1. University of Helsinki, 8–9.

4. Symbolic Model Checking without BDDs

5. Armin Biere, Katalin Fazekas, Mathias Fleury, and Maximillian Heisinger. 2020. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT competition 2020. In Proc. of SAT Competition 2020—Solver and Benchmark Descriptions (Department of Computer Science Report Series B), Vol. B-2020-1. University of Helsinki, 51–53.