The following pages link to semprop (Q40097):
Displaying 15 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- The QBF Gallery: behind the scenes (Q286397) (← links)
- The complexity of pure literal elimination (Q862401) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- From QBFs to \textsf{MALL} and back via focussing (Q2209553) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- Computational methods for database repair by signed formulae (Q2502158) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- Validating QBF Validity in HOL4 (Q3088005) (← links)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (Q3453224) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)