A general framework converts width-based model checking into algorithms for verifying graph conjectures on bounded-width classes, giving double-exponential time decision procedures for several conjectures on treewidth-k graphs.
Automata- based parsing in dynamic programming for linear indexed gra mmars
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
From Width-Based Model Checking to Width-Based Automated Theorem Proving
A general framework converts width-based model checking into algorithms for verifying graph conjectures on bounded-width classes, giving double-exponential time decision procedures for several conjectures on treewidth-k graphs.