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.
Moreover, for eachu∈B(τ)we haveϕ 1(θ[σ1](u)) =ϕ 2(θ[σ2](u)) =θ[τ](u)
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
-
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.