A new normal form, SynNNF, guarantees polynomial-time Skolem function synthesis and existential quantification, subsumes wDNNF/DNNF/ROBDD, and supports a CNF-to-SynNNF compiler that solves benchmarks beyond current tools.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Knowledge Compilation for Boolean Functional Synthesis
A new normal form, SynNNF, guarantees polynomial-time Skolem function synthesis and existential quantification, subsumes wDNNF/DNNF/ROBDD, and supports a CNF-to-SynNNF compiler that solves benchmarks beyond current tools.