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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
ACCEPT 1representative citing papers
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.