Laissez-Faire Caching for Parallel #SAT Solving

DOI10.1007/978-3-319-24318-4_5zbMath1471.68175OpenAlexW2232506718MaRDI QIDQ3453209

Bernd Becker, Jan Burchard, Tobias Schubert

Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (4)

Exploiting Database Management Systems and Treewidth for Counting ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ Unnamed Item ⋮ countAntom

Uses Software

• ManySAT
• Boost C++ Libraries
• PaMiraXT
• Plingeling
• antom
• Treengeling
• sharpSAT
• Lingeling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing

This page was built for publication: Laissez-Faire Caching for Parallel #SAT Solving