The following pages link to QUBOS (Q21561):
Displaying 23 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Quantifier elimination by dependency sequents (Q479823) (← 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)
- Solving QBF with Counterexample Guided Refinement (Q2843327) (← links)
- From (Quantified) Boolean Formulae to Answer Set Programming (Q3395260) (← links)
- Nenofex: Expanding NNF for QBF Solving (Q3502708) (← links)
- (Q3520999) (← links)
- A Unified Framework for Certificate and Compilation for QBF (Q3601811) (← links)
- A First Step Towards a Unified Proof Checker for QBF (Q3612467) (← links)
- Bounded Universal Expansion for Preprocessing QBF (Q3612470) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- (Q4427904) (← links)
- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (Q4930579) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Theory and Applications of Satisfiability Testing (Q5325863) (← links)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Q5900655) (← links)
