Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68213OpenAlexW2494235144MaRDI QIDQ5325868FDOQ5325868

Lintao Zhang, Sharad Malik

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

• Cache conscious data structures for Boolean satisfiability solvers
• Improving resource-unaware SAT solvers
• Efficient data structures for backtrack search SAT solvers
• Anatomy and empirical evaluation of modern SAT solvers
• Empirical study of the anatomy of modern SAT solvers

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Cited In (4)

• Formal Methods in Computer-Aided Design
• An overview of parallel SAT solving
• An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
• Efficient data structures for backtrack search SAT solvers

Uses Software

• SATO
• Chaff
• BerkMin
• Jerusat
• Velev SAT Benchmarks

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