Bloqqer
From MaRDI portal
Software:21559
swMATH9578MaRDI QIDQ21559FDOQ21559
Author name not available (Why is that?)
Cited In (31)
- Solving QBF with counterexample guided refinement
- The QBF Gallery: behind the scenes
- Encodings of Bounded Synthesis
- HordeQBF: A Modular and Massively Parallel QBF Solver
- Conformant planning as a case study of incremental QBF solving
- Recovering and Utilizing Partial Duality in QBF
- Algorithms for computing minimal equivalent subformulas
- Long Distance Q-Resolution with Dependency Schemes
- Q-Resolution with Generalized Axioms
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- Planning with Incomplete Information in Quantified Answer Set Programming
- Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination
- Quantifier reordering for QBF
- A game characterisation of tree-like Q-resolution size
- Solving QBF with Counterexample Guided Refinement
- Title not available (Why is that?)
- Preprocessing for DQBF
- Solution validation and extraction for QBF preprocessing
- On QBF Proofs and Preprocessing
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- A Unified Proof System for QBF Preprocessing
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
- Incremental Determinization
- Super-Blocked Clauses
- Long-distance Q-resolution with dependency schemes
- SAT-Inspired Eliminations for Superposition
- 2QBF: Challenges and Solutions
- Truth Assignments as Conditional Autarkies
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
This page was built for software: Bloqqer