Pages that link to "Item:Q814445"
From MaRDI portal
The following pages link to Backjumping for quantified Boolean logic satisfiability (Q814445):
Displaying 15 items.
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- Value ordering for quantified CSPs (Q1020498) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- Non-binary quantified CSP: Algorithms and modelling (Q1037645) (← links)
- Solving quantified constraint satisfaction problems (Q2389634) (← links)
- Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
- (Q2741533) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- Solution Directed Backjumping for QCSP (Q3523056) (← 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)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic (Q5387634) (← links)
