Improving resource-unaware SAT solvers

DOI10.1007/978-3-642-16242-8_37MaRDI QIDQ4933329zbMATH OpenOpenAlexFDO

Authors Steffen Hölldobler, Norbert Manthey, Ari Saptawijaya

Publication date 12 October 2010

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16242-8_37

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Satisfiability Testing
• Cache conscious data structures for Boolean satisfiability solvers
• Anatomy and empirical evaluation of modern SAT solvers
• Empirical study of the anatomy of modern SAT solvers
• Theory and Applications of Satisfiability Testing

Cited in

(10)

• The \textsc{MergeSat} solver
• Guiding high-performance SAT solvers with unsat-core predictions
• How we designed winning algorithms for abstract argumentation and which insight we attained
• An expressive model for instance decomposition based parallel SAT solvers
• Cache conscious data structures for Boolean satisfiability solvers
• SAT race 2015
• Automatic scheduling of periodic event networks by SAT solving
• Theory and Applications of Satisfiability Testing
• Using execution logs for improving pseudo-Boolean propagation
• Speeding up pseudo-Boolean propagation

Describes a project that uses

Uses Software

• MiniSat
• PAPI
• HPCTOOLKIT

This page was built for publication: Improving resource-unaware SAT solvers

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