Pages that link to "Item:Q2405263"
From MaRDI portal
The following pages link to DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL (Q2405263):
Displaying 20 items.
- Proof complexity of modal resolution (Q832717) (← links)
- Relating size and width in variants of Q-resolution (Q1653019) (← links)
- Polynomial-time validation of QCDCL certificates (Q1656583) (← 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)
- Lower bounds for QCDCL via formula gauge (Q2118284) (← links)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
- Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)
- Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
- Quantified Boolean Solving for Achievement Games (Q6488139) (← links)
- Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms (Q6535701) (← links)
- Transforming quantified Boolean formulas using biclique covers (Q6536143) (← links)
- Dependency schemes in CDCL-based QBF solving: a proof-theoretic study (Q6611965) (← links)
