The following pages link to DepQBF (Q21713):
Displaying 49 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Relating size and width in variants of Q-resolution (Q1653019) (← links)
- A little blocked literal goes a long way (Q1680260) (← links)
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property (Q1799077) (← links)
- Skolem functions for DQBF (Q1990517) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← 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)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- Combining resolution-path dependencies with dependency learning (Q2181941) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← 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)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL (Q2405263) (← links)
- Strong (D)QBF dependency schemes via tautology-free resolution paths (Q2661365) (← links)
- Positional games and QBF: the corrective encoding (Q2661369) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- Incremental Determinization (Q2818028) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- 2QBF: Challenges and Solutions (Q2818033) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- Off the Trail: Re-examining the CDCL Algorithm (Q2843320) (← links)
- Solving QBF with Counterexample Guided Refinement (Q2843327) (← links)
- Incremental QBF Solving by DepQBF (Q2879140) (← links)
- Failed Literal Detection for QBF (Q3007688) (← links)
- MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing (Q3192089) (← links)
- A Unified Proof System for QBF Preprocessing (Q3192183) (← links)
- Bounded Synthesis for Petri Games (Q3449635) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (Q3453224) (← links)
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (Q3453239) (← links)
- Integrating Dependency Schemes in Search-Based QBF Solvers (Q4930586) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)
- Blocked Clause Elimination for QBF (Q5200018) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- On Propositional QBF Expansions and Q-Resolution (Q5326454) (← links)
- Recovering and Utilizing Partial Duality in QBF (Q5326455) (← links)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (Q5326456) (← links)
