Enhancing search-based QBF solving by dynamic blocked clause elimination
From MaRDI portal
Publication:3460072
Recommendations
Cited in
(18)- Q-resolution with generalized axioms
- Long distance Q-resolution with dependency schemes
- Dynamically Partitioning for Solving QBF
- Solving QBF with counterexample guided refinement
- Local redundancy in SAT: generalizations of blocked clauses
- Conformant planning as a case study of incremental QBF solving
- Interpolation-based semantic gate extraction and its applications to QBF preprocessing
- The power of non-ground rules in Answer Set Programming
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- A game characterisation of tree-like Q-resolution size
- Super-blocked clauses
- Truth assignments as conditional autarkies
- Solution validation and extraction for QBF preprocessing
- CAQE and QuAbS: Abstraction Based QBF Solvers
- Long-distance Q-resolution with dependency schemes
- HordeQBF: a modular and massively parallel QBF solver
- Blocked clause elimination for QBF
This page was built for publication: Enhancing search-based QBF solving by dynamic blocked clause elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460072)