The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
DOI10.1016/J.ARTINT.2019.04.002zbMATH Open1478.68332OpenAlexW2937448176WikidataQ128067016 ScholiaQ128067016MaRDI QIDQ2321317FDOQ2321317
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.04.002
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
- Blocked Clause Elimination for QBF
- MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
- On the computational cost of disjunctive logic programming: Propositional case
- Solving QBF with counterexample guided refinement
- Solving QBF with Counterexample Guided Refinement
- The QBF Gallery: behind the scenes
- Abstraction-Based Algorithm for 2QBF
- Failed Literal Detection for QBF
- A Non-prenex, Non-clausal QBF Solver with Game-State Learning
- Dependency learning for QBF
- A self-adaptive multi-engine solver for quantified Boolean formulas
- The Seventh QBF Solvers Evaluation (QBFEVAL’10)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning
- Automated Testing and Debugging of SAT and QBF Solvers
- SAT race 2015
- Theory and Applications of Satisfiability Testing
- HordeSat: A Massively Parallel Portfolio SAT Solver
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Non-prenex QBF Solving Using Abstraction
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes
- Incremental Determinization
- Evaluating and certifying QBFs: A comparison of state-of-the-art tools
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
- Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows
- HordeQBF: A Modular and Massively Parallel QBF Solver
- Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
Cited In (14)
- Certified DQBF solving by definition extraction
- Lower bounds for QCDCL via formula gauge
- DQBDD: an efficient BDD-based DQBF solver
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Lower bounds for QCDCL via formula gauge
- CAQE and QuAbS: Abstraction Based QBF Solvers
- A simple proof of QBF hardness
- OuterCount: a first-level solution-counter for quantified Boolean formulas
- Common equivalence and size of forgetting from Horn formulae
- Transforming quantified Boolean formulas using biclique covers
- Never trust your solver: certification for SAT and QBF
- QBFFam: a tool for generating QBF families from proof complexity
Uses Software
This page was built for publication: The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321317)
