FO2 groundings can require 2^Ω(n) DNNF size, but a type-based compiler with residual caching often yields smaller circuits and faster runtimes than naive grounding.
and Singh, Guramrit and Dilkas, Paulius and Meel, Kuldeep S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Knowledge Compilation For Two-Variable First-Order Logic
FO2 groundings can require 2^Ω(n) DNNF size, but a type-based compiler with residual caching often yields smaller circuits and faster runtimes than naive grounding.