Cited in
(84)- Solving QBF with counterexample guided refinement
- Knowledge representation analysis of graph mining
- Solving QBF with counterexample guided refinement
- Proof complexity of modal resolution
- Skolem functions for DQBF
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Conformant planning as a case study of incremental QBF solving
- Hardness and optimality in QBF proof systems modulo NP
- Lower bounds for QCDCL via formula gauge
- Bounded synthesis for Petri games
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
- Planning with Incomplete Information in Quantified Answer Set Programming
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- Failed literal detection for QBF
- On propositional QBF expansions and Q-resolution
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Solving dependency quantified Boolean formulas using quantifier localization
- Relating size and width in variants of Q-resolution
- Incremental QBF solving by DepQBF
- A unified proof system for QBF preprocessing
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- Recovering and utilizing partial duality in QBF
- QuBE++
- sQueezeBF
- Quaffle
- Bloqqer
- Nenofex
- HeerHugo
- QBFLIB
- QUBOS
- CirQit2
- QUBE
- QMiraXT
- Coprocessor
- GRAPPA
- HordeQBF
- MPIDepQBF
- Lpopt
- CNFgen
- DIAMOND
- QBFEVAL
- AIGSolve
- CAQE
- Quantor
- HQSpre
- semprop
- selp
- eclingo
- sKizzo
- Expansion-based QBF solving versus Q-resolution
- On Q-resolution and CDCL QBF solving
- RAReQS
- Positional games and QBF: the corrective encoding
- Incremental determinization
- Proof complexity of symbolic QBF reasoning
- Integrating dependency schemes in search-based QBF solvers
- Dual proof generation for quantified Boolean formulas with a BDD-based solver
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
- 2QBF: challenges and solutions
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- GANAK
- A little blocked literal goes a long way
- Preprocessing for DQBF
- Solution validation and extraction for QBF preprocessing
- Combining resolution-path dependencies with dependency learning
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Off the Trail: Re-examining the CDCL Algorithm
- QBFFam
- QRATPre+
- Solving Advanced Argumentation Problems with Answer Set Programming
- Backdoors to normality for disjunctive logic programs
- Computing smallest MUSes of quantified Boolean formulas
- HordeQBF: a modular and massively parallel QBF solver
- Blocked clause elimination for QBF
- dCAQE
- GhostQ
- QBFFam: a tool for generating QBF families from proof complexity
- QESTO
- Strong (D)QBF dependency schemes via tautology-free resolution paths
- \(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Aeon
This page was built for software: DepQBF
