HordeQBF: A Modular and Massively Parallel QBF Solver

April 13, 2016 · The Ethereal · 🏛 International Conference on Theory and Applications of Satisfiability Testing

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tomas Balyo, Florian Lonsing arXiv ID 1604.03793 Category cs.LO: Logic in CS Cross-listed cs.AI Citations 8 Venue International Conference on Theory and Applications of Satisfiability Testing Last Checked 5 months ago
Abstract
The recently developed massively parallel satisfiability (SAT) solver HordeSAT was designed in a modular way to allow the integration of any sequential CDCL-based SAT solver in its core. We integrated the QCDCL-based quantified Boolean formula (QBF) solver DepQBF in HordeSAT to obtain a massively parallel QBF solver---HordeQBF. In this paper we describe the details of this integration and report on results of the experimental evaluation of HordeQBF's performance. HordeQBF achieves superlinear average and median speedup on the hard application instances of the 2014 QBF Gallery.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS