Pages that link to "Item:Q2843327"
From MaRDI portal
The following pages link to Solving QBF with Counterexample Guided Refinement (Q2843327):
Displaying 28 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- The QBF Gallery: behind the scenes (Q286397) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable (Q903199) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- How QBF expansion makes strategy extraction hard (Q2096438) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← 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)
- An approximation framework for solvers and decision procedures (Q2362497) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- Long-distance Q-resolution with dependency schemes (Q2417950) (← links)
- Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models (Q2423750) (← links)
- Incremental Determinization (Q2818028) (← links)
- Non-prenex QBF Solving Using Abstraction (Q2818029) (← links)
- 2QBF: Challenges and Solutions (Q2818033) (← links)
- Long Distance Q-Resolution with Dependency Schemes (Q2818036) (← links)
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Lower Bound Techniques for QBF Proof Systems (Q3304096) (← links)
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (Q3453239) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- GhostQ (Q5015604) (← links)
