Generating Extended Resolution Proofs with a BDD-Based SAT Solver
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
复制标题
使用基于 BDD 的 SAT 求解器生成扩展分辨率证明
DOI:
10.1145/3595295
复制
发表时间:
2023
影响因子:
0.5
通讯作者:
Heule, Marijn J.
中科院分区:
文献类型:
--
作者:
Bryant, Randal E.;Heule, Marijn J.
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 theextended resolutionlogical 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.
登录
查看更多内容
DOI:
10.1007/978-3-319-70389-3_12
发表时间:
2017
期刊:
ArXiv
影响因子:
--
作者:
Marijn J. H. Heule;B. Kiesl;M. Seidl;Armin Biere
通讯作者:
Armin Biere
DOI:
10.1007/978-3-030-51825-7_1
发表时间:
2020-06-26
期刊:
Theory and Applications of Satisfiability Testing – SAT 2020
影响因子:
--
作者:
Chew L;Heule MJ
通讯作者:
Heule MJ
DOI:
10.48550/arxiv.2304.04292
发表时间:
2023
期刊:
ArXiv
影响因子:
--
作者:
M. Soos;R. Bryant
通讯作者:
R. Bryant
DOI:
10.1007/978-3-030-99524-9_25
发表时间:
2022
期刊:
International Conference on Tools and Algorithms for the Construction and Analysis of Systems
影响因子:
--
作者:
Bryant, Randal E.;Heule, Marijn J.
通讯作者:
Heule, Marijn J.
影响因子:
1.2
作者:
A. V. Gelder
通讯作者:
A. V. Gelder