Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325870zbMATH OpenOpenAlexDBLPFDO

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

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)

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

Cited in

(8)

• Exploiting tree decomposition for guiding neighborhoods exploration for VNS
• Davis and Putnam meet Henkin: solving DQBF with resolution
• A SAT approach to branchwidth
• Decomposing SAT Instances with Pseudo Backbones
• A SAT approach to branchwidth
• Recognition of Nested Gates in CNF Formulas
• Counting truth assignments of formulas of bounded tree-width or clique-width
• SAT-based local improvement for finding tree decompositions of small width

Describes a project that uses

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)