Nenofex
From MaRDI portal
Software:21560
swMATH9579MaRDI QIDQ21560FDOQ21560
Author name not available (Why is that?)
Cited In (17)
- Solving QBF with counterexample guided refinement
- Solving QBF with counterexample guided refinement
- Conformant planning as a case study of incremental QBF solving
- Non-prenex QBF solving using abstraction
- A non-prenex, non-clausal QBF solver with game-state learning
- Failed literal detection for QBF
- Dependency learning for QBF
- Expansion-based QBF solving versus Q-resolution
- The seventh QBF solvers evaluation (QBFEVAL'10)
- Incremental determinization
- Efficiently representing existential dependency sets for expansion-based QBF solvers
- A Unified Framework for Certificate and Compilation for QBF
- On QBF Proofs and Preprocessing
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
- sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
- Exploiting circuit representations in QBF solving
- Blocked clause elimination for QBF
This page was built for software: Nenofex
