Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325859zbMATH OpenOpenAlexDBLPFDO

Authors Elizabeth Broering, Satyanarayana V. Lokam

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

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Satisfiability, branch-width and Tseitin tautologies
• Width-parametrized SAT: time-space tradeoffs
• Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
• Better algorithms for satisfiability problems for formulas of bounded rank-width
• Resolution versus search: Two strategies for SAT

Cited in

(8)

• Empirical study of the anatomy of modern SAT solvers
• Satisfiability, branch-width and Tseitin tautologies
• Size-treewidth tradeoffs for circuits computing the element distinctness function
• New width parameters for SAT and \#SAT
• An upper bound for resolution size: characterization of tractable SAT instances
• Width-parametrized SAT: time-space tradeoffs
• On the satisfiability of quantum circuits of small treewidth
• On the satisfiability of quantum circuits of small treewidth

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 Q5325859)