Pages that link to "Item:Q2751045"
From MaRDI portal
The following pages link to An algorithm to evaluate quantified Boolean formulae and its experimental evaluation (Q2751045):
Displaying 20 items.
- On 2-QBF truth testing in parallel (Q672737) (← links)
- An effective algorithm for the futile questioning problem (Q812439) (← links)
- Models and quantifier elimination for quantified Horn formulas (Q944709) (← links)
- Non-binary quantified CSP: Algorithms and modelling (Q1037645) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation (Q1610666) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Solving quantified constraint satisfaction problems (Q2389634) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- Boolean functions as models for quantified Boolean formulas (Q2642467) (← links)
- Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211) (← links)
- (Q4520773) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Theory and Applications of Satisfiability Testing (Q5325863) (← links)
