HordeQBF: A Modular and Massively Parallel QBF Solver

DOI10.1007/978-3-319-40970-2_33zbMath1475.68429arXiv1604.03793OpenAlexW2336733340MaRDI QIDQ2818039

Florian Lonsing, Tomáš Balyo

Publication date: 5 September 2016

Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.03793

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)

Uses Software

• MiniSat
• PSATO
• SATO
• MPI/MPICH
• PicoSAT
• Quaffle
• Bloqqer
• DepQBF
• QUBE
• QMiraXT
• HordeSat
• HordeQBF
• MPIDepQBF
• semprop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A high-performance, portable implementation of the MPI message passing interface standard
• Resolution for quantified Boolean formulas
• PSATO: A distributed propositional prover and its application to quasigroup problems
• Unified QBF certification and its applications
• Clause Elimination for SAT and QSAT
• QBF Resolution Systems and Their Proof Complexities
• MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
• HordeSat: A Massively Parallel Portfolio SAT Solver
• Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
• Integrating Dependency Schemes in Search-Based QBF Solvers
• Theory and Applications of Satisfiability Testing

This page was built for publication: HordeQBF: A Modular and Massively Parallel QBF Solver