Pages that link to "Item:Q253964"
From MaRDI portal
The following pages link to Solving QBF with counterexample guided refinement (Q253964):
Displayed 24 items.
- Proof complexity of modal resolution (Q832717) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- Dual proof generation for quantified Boolean formulas with a BDD-based solver (Q2055876) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- QBFFam: a tool for generating QBF families from proof complexity (Q2118282) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Certified DQBF solving by definition extraction (Q2118343) (← links)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- Encodings of Bounded Synthesis (Q3303904) (← links)
- (Q3304106) (← links)
- (Q3384880) (← links)
- (Q4553279) (← links)
- GhostQ (Q5015604) (← links)
- CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
- (Q5136303) (← links)
- RAReQS (Q5973448) (← links)
- Never trust your solver: certification for SAT and QBF (Q6118810) (← links)
- BOCoSy: Small but Powerful Symbolic Output-Feedback Control (Q6120724) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)