A symbolic search based approach for quantified Boolean formulas
From MaRDI portal
Recommendations
Cited in
(21)- A self-adaptive multi-engine solver for quantified Boolean formulas
- Circuit-based search space pruning in QBF
- Dual proof generation for quantified Boolean formulas with a BDD-based solver
- Abstract solvers for quantified Boolean formulas and their applications
- Incremental determinization
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
- Planning as quantified Boolean formula
- Enhancing search-based QBF solving by dynamic blocked clause elimination
- Using SAT in QBF
- Dynamically Partitioning for Solving QBF
- Theory and Applications of Satisfiability Testing
- Evaluating QBFs via symbolic Skolemization
- A branching heuristics for quantified renamable Horn formulas
- Search vs. symbolic techniques in satisfiability solving
- Analysis of search based algorithms for satisfiability of propositional and quantified Boolean formulas arising from circuit state space diameter problems
- Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
- Binary Clause Reasoning in QBF
- Using stochastic local search to solve quantified Boolean formulae
- Principles and Practice of Constraint Programming – CP 2004
- OuterCount: a first-level solution-counter for quantified Boolean formulas
- Quantified Boolean Solving for Achievement Games
This page was built for publication: A symbolic search based approach for quantified Boolean formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713717)