Report of the third QBF solvers evaluation
From MaRDI portal
Recommendations
Cited in
(15)- A self-adaptive multi-engine solver for quantified Boolean formulas
- A solver for QBFs in negation normal form
- Voting by eliminating quantifiers
- Encoding deductive argumentation in quantified Boolean formulae
- New models for generating hard random Boolean formulas and disjunctive logic programs
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Compressing BMC encodings with QBF
- Validating QBF Validity in HOL4
- Evaluating and certifying QBFs: a comparison of state-of-the-art tools
- Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows
- The seventh QBF solvers evaluation (QBFEVAL'10)
- CAQE and QuAbS: Abstraction Based QBF Solvers
- Theory and Applications of Satisfiability Testing
- Formal Methods in Computer-Aided Design
- Theory and Applications of Satisfiability Testing
This page was built for publication: Report of the third QBF solvers evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429159)