The following pages link to (Q4427904):
Displaying 19 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Symmetry in Gardens of Eden (Q396822) (← links)
- Quantifier elimination by dependency sequents (Q479823) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Computational methods for database repair by signed formulae (Q2502158) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- A Splitting Algorithm Based on Soft Constraints for the Computation of Truth Degree in Quantitative Logic (Q3145830) (← links)
- A Unified Framework for Certificate and Compilation for QBF (Q3601811) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (Q5326456) (← links)
- Automata, Languages and Programming (Q5466546) (← links)
