Cache conscious data structures for Boolean satisfiability solvers

MaRDI QIDQ3181647zbMATH OpenFDO

Authors Geoffrey Chu, Aaron Harwood, Peter J. Stuckey

Publication date 12 October 2009

zbMATH Keywords

cache-aware data structures

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Satisfiability Testing
• Improving resource-unaware SAT solvers
• Efficient data structures for backtrack search SAT solvers
• scientific article; zbMATH DE number 5510692
• scientific article; zbMATH DE number 2090309

Cited in

(11)

• Efficient data structures for backtrack search SAT solvers
• A subset-matching size-bounded cache for testing satisfiability in modal logics
• scientific article; zbMATH DE number 1612554 (Why is no real title available?)
• Laissez-faire caching for parallel \#SAT solving
• An overview of parallel SAT solving
• Improving resource-unaware SAT solvers
• Theory and Applications of Satisfiability Testing
• An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
• Using execution logs for improving pseudo-Boolean propagation
• Speeding up pseudo-Boolean propagation
• Lazy reimplication in chronological backtracking

Describes a project that uses

Uses Software

• MiniSat
• Siege
• Chaff
• PicoSAT
• FORCE

This page was built for publication: Cache conscious data structures for Boolean satisfiability solvers

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