A new parallel architecture for QBF tools

Mota, Benoit Da; Pichon, Nicolas; Stéphan, Igor

doi:10.1109/hpcs.2010.5547114

Cited by 5 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The master balances the workload by generating subproblems defined by variable assignments (assumptions), which are solved by the workers. Parallel solving approaches have also been presented for quantified CSPs [24] and non-PCNF QBFs [21].…”

Section: Related Workmentioning

confidence: 99%

HordeQBF: A Modular and Massively Parallel QBF Solver

Balyo

Lonsing

2016

Theory and Applications of Satisfiability Testing – SAT 2016

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

HordeQBF: A Modular and Massively Parallel QBF Solver

Balyo

Lonsing

2016

Theory and Applications of Satisfiability Testing – SAT 2016

View full text Add to dashboard Cite

show abstract

“…By encoding QBF into SAT, QMiraXT became the first published parallel QBF solver [14]. A similar QBF solver can be found in [15,9].…”

Section: Related Workmentioning

confidence: 99%

Exploiting parallelism in the ME calculus

Liang

Tinelli

EPiC Series in Computing

View full text Add to dashboard Cite

We present some parallelization techniques for the Model Evolution (ME) calculus, an instantiation-based calculus that lifts the DPLL procedure to first-order clause logic. Specifically, we consider a restriction of ME to the EPR fragment of clause logic for which the calculus is a decision procedure. The main operations in ME's proof procedures, namely clause instantiation and candidate literal generation, offer opportunities for MapReducestyle parallelization. This term/clause-level parallelization is largely orthogonal to the sort of search-level parallelization performed by portfolio approaches. We describe a hybrid parallel proof procedure for the restricted calculus that exploits parallelism at both levels to synergistic effect. The calculus and the proof procedure have been implemented in a new solver for EPR formulas. Our initial experimental results show that our term/clauselevel parallelization alone is effective in reducing runtime and can be combined with a portfolio-based approach to maximize performance.

show abstract

Non-prenex QBF Solving Using Abstraction

Tentrup

2016

Theory and Applications of Satisfiability Testing – SAT 2016

View full text Add to dashboard Cite

A new parallel architecture for QBF tools

Cited by 5 publications

References 18 publications

HordeQBF: A Modular and Massively Parallel QBF Solver

HordeQBF: A Modular and Massively Parallel QBF Solver

Exploiting parallelism in the ME calculus

Non-prenex QBF Solving Using Abstraction

Contact Info

Product

Resources

About