Certified DQBF Solving by Definition Extraction

Reichl, Franz-Xaver; Slivovsky, Friedrich; Szeider, Stefan

doi:10.1007/978-3-030-80223-3_34

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Article2

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It also fails to detect gates after elimination of one of the input variables. Recently semantic approaches based on Padoa's theorem [34] have been developed with applications in model counting [28] and a similar technique exists for (D)QBF reasoning [35,37]. In both approaches a SAT solver is used as oracle to find gate clauses.…”

Section: Introductionmentioning

confidence: 99%

Mining definitions in Kissat with Kittens

Fleury

Biere

2022

Form Methods Syst Des

View full text Add to dashboard Cite

Bounded variable elimination is one of the most important preprocessing techniques in SAT solving. It benefits from discovering functional dependencies in the form of definitions encoded in the CNF. While the common approach pioneered in SatELite relies on syntactic pattern matching, our new approach uses cores produced by an embedded SAT solver, Kitten. In contrast to a similar semantic technique implemented in Lingeling based on BDD algorithms to generate irredundant CNFs, our new approach is able to generate DRAT proofs. We further discuss design choices for our embedded SAT solver Kitten. Experiments with Kissat show the effectiveness of this approach.

show abstract