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
• On Propositional QBF Expansions and Q-Resolution
• Proof complexity of modal resolution
• Skolem functions for DQBF
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• HordeQBF: A Modular and Massively Parallel QBF Solver
• Conformant planning as a case study of incremental QBF solving
• Recovering and Utilizing Partial Duality in QBF
• Hardness and optimality in QBF proof systems modulo NP
• Lower bounds for QCDCL via formula gauge
• Integrating Dependency Schemes in Search-Based QBF Solvers
• 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
• MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
• A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Solving dependency quantified Boolean formulas using quantifier localization
• Backdoors to Normality for Disjunctive Logic Programs
• Relating size and width in variants of Q-resolution
• Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
• Expansion-based QBF solving versus Q-resolution
• Positional games and QBF: the corrective encoding
• Bounded Synthesis for Petri Games
• Blocked Clause Elimination for QBF
• Proof complexity of symbolic QBF reasoning
• Solving QBF with Counterexample Guided Refinement
• Dual proof generation for quantified Boolean formulas with a BDD-based solver
• \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
• Failed Literal Detection for QBF
• 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
• Incremental QBF Solving by DepQBF
• Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
• Off the Trail: Re-examining the CDCL Algorithm
• On Q-Resolution and CDCL QBF Solving
• Solving Advanced Argumentation Problems with Answer Set Programming
• A Unified Proof System for QBF Preprocessing
• Incremental Determinization
• Computing smallest MUSes of quantified Boolean formulas
• 2QBF: Challenges and Solutions
• QBFFam: a tool for generating QBF families from proof complexity
• Strong (D)QBF dependency schemes via tautology-free resolution paths
• Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
• QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving

This page was built for software: DepQBF