TreeWidzard supplies a unified engine for width-parameterized dynamic programming on graphs together with automated theorem proving over all bounded-treewidth graphs.
State canonization and early pruning in width-based automated theorem proving
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving
TreeWidzard supplies a unified engine for width-parameterized dynamic programming on graphs together with automated theorem proving over all bounded-treewidth graphs.