Pages that link to "Item:Q1040783"
From MaRDI portal
The following pages link to Backdoor sets of quantified Boolean formulas (Q1040783):
Displaying 30 items.
- Quantifier reordering for QBF (Q287386) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes (Q896919) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Backdoors to planning (Q2321271) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- A generalized back-door criterion (Q2352735) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- Long-distance Q-resolution with dependency schemes (Q2417950) (← links)
- On the Hardness of SAT with Community Structure (Q2818008) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- Dependency Schemes for DQBF (Q2818034) (← links)
- Long Distance Q-Resolution with Dependency Schemes (Q2818036) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- Should Decisions in QCDCL Follow Prefix Order? (Q6493568) (← links)
- Backdoor DNFs (Q6564620) (← links)
- Dependency schemes in CDCL-based QBF solving: a proof-theoretic study (Q6611965) (← links)
