Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68104DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325870FDOQ5325870

Authors:

Publication date: 24 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• SAT-based local improvement for finding tree decompositions of small width
• A SAT approach to branchwidth
• A SAT approach to branchwidth
• SAT-encodings for treecut width and treedepth
• Theory and Applications of Satisfiability Testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Hypergraphs (05C65)

Cited In (4)

• Davis and Putnam meet Henkin: solving DQBF with resolution
• Decomposing SAT Instances with Pseudo Backbones
• Recognition of Nested Gates in CNF Formulas
• Counting truth assignments of formulas of bounded tree-width or clique-width

Uses Software

• Chaff

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325870)