# BOSPHORUS: Bridging ANF and CNF Solvers

arXiv: https://arxiv.org/abs/1812.04580 · HTML: https://mlsanity.com/paper/1812.04580/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Dec 2018.

## Built on by (most cited first, 1 of 1)

- [Power Term Polynomial Algebra for Boolean Logic](https://mlsanity.com/paper/2603.13854/) (2026)

## Abstract (arXiv)

Algebraic Normal Form (ANF) and Conjunctive Normal Form (CNF) are commonly used to encode problems in Boolean algebra. ANFs are typically solved via Gr"obner basis algorithms, often using more memory than is feasible; while CNFs are solved using SAT solvers, which cannot exploit the algebra of polynomials naturally. We propose a paradigm that bridges between ANF and CNF solving techniques: the techniques are applied in an iterative manner to emph{learn facts} to augment the original problems. Experiments on over 1,100 benchmarks arising from four different applications domains demonstrate that learnt facts can significantly improve runtime and enable more benchmarks to be solved.