State canonization and early pruning make width-based theorem proving practical enough to confirm Reed's conjecture on triangle-free graphs of pathwidth 5 and treewidth 3 and to discover counterexamples to invalid strengthenings.
TreeWidzard: A tool for width-based automated theorem proving
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
TreeWidzard supplies a unified engine for width-parameterized dynamic programming on graphs together with automated theorem proving over all bounded-treewidth graphs.
citing papers explorer
-
State Canonization and Early Pruning in Width-Based Automated Theorem Proving
State canonization and early pruning make width-based theorem proving practical enough to confirm Reed's conjecture on triangle-free graphs of pathwidth 5 and treewidth 3 and to discover counterexamples to invalid strengthenings.
-
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.