HordeQBF: A Modular and Massively Parallel QBF Solver
نویسندگان
چکیده
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.
منابع مشابه
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Inspired by recent work on parallel SAT solving, we present a lightweight approach for solving quantified Boolean formulas (QBFs) in parallel. In particular, our approach uses a sequential state-of-the-art QBF solver to evaluate subformulas in working processes. It abstains from globally exchanging information between the workers, but keeps learnt information only locally. To this end, we equip...
متن کاملHordeSat: A Massively Parallel Portfolio SAT Solver
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution. The SAT solvers in the portfolio can be instances of a single solver with different configuration settings. Additionally the solvers can exchange information usually in the form of clauses. In ...
متن کاملPaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
In this paper we present the parallel QBF Solver PaQuBE. This new solver leverages the additional computational power that can be exploited from modern computer architectures, from pervasive multicore boxes to clusters and grids, to solve more relevant instances and faster than previous generation solvers. PaQuBE extends QuBE, its sequential core, by providing a Master/SlaveMessage Passing Inte...
متن کاملQmiraXT - A Multithreaded QBF Solver
This paper introduces the state-of-the-art multithreaded QBF solver QMiraXT. QMiraXT is the first parallel QBF Solver that supports advanced features such as: conflict/solution analysis with non-chronological backtracking; knowledge sharing between threads; and novel preprocessing and decision heuristics. By utilizing these features, QMiraXT is significantly faster on industrial and formal veri...
متن کاملBeyond CNF: A Circuit-Based QBF Solver
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Normal Form (CNF) in representing the QBF formula. Although CNF has worked well for SAT solvers, recent work has pointed out some inherent problems with using CNF in QBF solvers. In this paper, we describe a QBF solver, call...
متن کامل