HordeQBF: A Modular and Massively Parallel QBF Solver
Logic in Computer Science
2016-06-15 v1 Artificial Intelligence
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.
Keywords
Cite
@article{arxiv.1604.03793,
title = {HordeQBF: A Modular and Massively Parallel QBF Solver},
author = {Tomas Balyo and Florian Lonsing},
journal= {arXiv preprint arXiv:1604.03793},
year = {2016}
}
Comments
camera-ready version, 6-page tool paper, to appear in the proceedings of SAT 2016, LNCS, Springer