Non-clausal Redundancy Properties
Non-clausal Redundancy Properties
复制标题
非子句冗余属性
DOI:
10.1007/978-3-030-79876-5_15
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Armin Biere
中科院分区:
文献类型:
--
作者:
L. Barnett;Armin Biere;L. Barnett;Armin Biere
State-of-the-art refutation systems for SAT are largely based on the derivation of clauses meeting some redundancy criteria, ensuring their addition to a formula does not alter its satisfiability. However, there are strong propositional reasoning techniques whose inferences are not easily expressed in such systems. This paper extends the redundancy framework beyond clauses to characterize redundancy for Boolean constraints in general. We show this characterization can be instantiated to develop efficiently checkable refutation systems using redundancy properties for Binary Decision Diagrams (BDDs). Using a form of reverse unit propagation over conjunctions of BDDs, these systems capture, for instance, Gaussian elimination reasoning over XOR constraints encoded in a formula, without the need for clausal translations or extension variables. Notably, these systems generalize those based on the strong Propagation Redundancy (PR) property, without an increase in complexity.
影响因子:
0.5
作者:
Bryant, Randal E.;Heule, Marijn J.
通讯作者:
Heule, Marijn J.
DOI:
10.1007/s10817-019-09516-0
发表时间:
2020-03-01
期刊:
JOURNAL OF AUTOMATED REASONING
影响因子:
--
作者:
Heule, Marijn J. H.;Kiesl, Benjamin;Biere, Armin
通讯作者:
Biere, Armin