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.
Cite
CITATION STYLE
Balyo, T., & Lonsing, F. (2016). HordeQBF: A modular and massively parallel QBF solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9710, pp. 531–538). Springer Verlag. https://doi.org/10.1007/978-3-319-40970-2_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
