Graph theory characterizes BVA reencodings, proving any 2-CNF on n variables can be reduced to roughly 0.396 n²/lg n clauses with minor extra steps and that at-most-one needs at least 3n-6 clauses.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
New ERCL algorithm using dual implication points in CDCL SAT solvers shows performance gains over baselines on Tseitin and XORified formulas.
citing papers explorer
-
Automated Reencoding Meets Graph Theory
Graph theory characterizes BVA reencodings, proving any 2-CNF on n variables can be reduced to roughly 0.396 n²/lg n clauses with minor extra steps and that at-most-one needs at least 3n-6 clauses.
-
Extended Resolution Clause Learning via Dual Implication Points
New ERCL algorithm using dual implication points in CDCL SAT solvers shows performance gains over baselines on Tseitin and XORified formulas.