DepQBF

swMATH9734MaRDI QIDQ21713FDOQ21713

Author name not available (Why is that?)

Source code repository: https://github.com/lonsing/depqbf

Cited In (49)

• Knowledge representation analysis of graph mining
• Solving QBF with counterexample guided refinement
• Solving QBF with counterexample guided refinement
• Proof complexity of modal resolution
• Skolem functions for DQBF
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Conformant planning as a case study of incremental QBF solving
• Hardness and optimality in QBF proof systems modulo NP
• Lower bounds for QCDCL via formula gauge
• Bounded synthesis for Petri games
• Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
• Planning with Incomplete Information in Quantified Answer Set Programming
• A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
• Failed literal detection for QBF
• On propositional QBF expansions and Q-resolution
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Solving dependency quantified Boolean formulas using quantifier localization
• Relating size and width in variants of Q-resolution
• Incremental QBF solving by DepQBF
• Recovering and utilizing partial duality in QBF
• A unified proof system for QBF preprocessing
• Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
• Expansion-based QBF solving versus Q-resolution
• On Q-resolution and CDCL QBF solving
• Positional games and QBF: the corrective encoding
• Incremental determinization
• Proof complexity of symbolic QBF reasoning
• Integrating dependency schemes in search-based QBF solvers
• Dual proof generation for quantified Boolean formulas with a BDD-based solver
• QELL: QBF reasoning with extended clause learning and levelized SAT solving
• 2QBF: challenges and solutions
• \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
• A little blocked literal goes a long way
• Preprocessing for DQBF
• Solution validation and extraction for QBF preprocessing
• Combining resolution-path dependencies with dependency learning
• Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
• Off the Trail: Re-examining the CDCL Algorithm
• Solving Advanced Argumentation Problems with Answer Set Programming
• Backdoors to normality for disjunctive logic programs
• Computing smallest MUSes of quantified Boolean formulas
• HordeQBF: a modular and massively parallel QBF solver
• Blocked clause elimination for QBF
• QBFFam: a tool for generating QBF families from proof complexity
• \(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing
• Strong (D)QBF dependency schemes via tautology-free resolution paths
• Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API

This page was built for software: DepQBF