Treewidth in Verification: Local vs. Global

DOI10.1007/11591191_34zbMath1143.68450OpenAlexW1539278744MaRDI QIDQ5387860

Guoqiang Pan, Andrea Ferrara, Moshe Y. Vardi

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11591191_34

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (12)

On the read-once property of branching programs and CNFs of bounded treewidth ⋮ On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width ⋮ On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth ⋮ On compiling structured CNFs to OBDDs ⋮ On the Tractability of SHAP Explanations ⋮ No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ Consistency checking and querying in probabilistic databases under integrity constraints ⋮ Unnamed Item ⋮ On tseitin formulas, read-once branching programs and treewidth ⋮ Proof complexity of symbolic QBF reasoning

This page was built for publication: Treewidth in Verification: Local vs. Global