Pages that link to "Item:Q3007686"
From MaRDI portal
The following pages link to Abstraction-Based Algorithm for 2QBF (Q3007686):
Displaying 14 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- Symmetry in Gardens of Eden (Q396822) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
- Refutation-based synthesis in SMT (Q2280222) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Incremental Determinization (Q2818028) (← links)
- 2QBF: Challenges and Solutions (Q2818033) (← links)
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (Q3453239) (← links)
