DepQBF

swMATH9734MaRDI QIDQ21713

No author found.

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

Related Items (49)

Backdoors to Normality for Disjunctive Logic Programs ⋮ Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Solution validation and extraction for QBF preprocessing ⋮ Proof complexity of modal resolution ⋮ Bounded Synthesis for Petri Games ⋮ Preprocessing for DQBF ⋮ Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving ⋮ Solving dependency quantified Boolean formulas using quantifier localization ⋮ Relating size and width in variants of Q-resolution ⋮ MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing ⋮ A Unified Proof System for QBF Preprocessing ⋮ Conformant planning as a case study of incremental QBF solving ⋮ On Propositional QBF Expansions and Q-Resolution ⋮ Recovering and Utilizing Partial Duality in QBF ⋮ Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation ⋮ Strong (D)QBF dependency schemes via tautology-free resolution paths ⋮ Positional games and QBF: the corrective encoding ⋮ DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL ⋮ Combining resolution-path dependencies with dependency learning ⋮ A little blocked literal goes a long way ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ Computing smallest MUSes of quantified Boolean formulas ⋮ Failed Literal Detection for QBF ⋮ Skolem functions for DQBF ⋮ Integrating Dependency Schemes in Search-Based QBF Solvers ⋮ A formal methods approach to predicting new features of the eukaryotic vesicle traffic system ⋮ Blocked Clause Elimination for QBF ⋮ Solving Advanced Argumentation Problems with Answer Set Programming ⋮ \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property ⋮ Incremental Determinization ⋮ On Q-Resolution and CDCL QBF Solving ⋮ 2QBF: Challenges and Solutions ⋮ HordeQBF: A Modular and Massively Parallel QBF Solver ⋮ Dual proof generation for quantified Boolean formulas with a BDD-based solver ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ Knowledge representation analysis of graph mining ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ Reinterpreting dependency schemes: soundness meets incompleteness in DQBF ⋮ Off the Trail: Re-examining the CDCL Algorithm ⋮ Solving QBF with Counterexample Guided Refinement ⋮ Expansion-based QBF solving versus Q-resolution ⋮ Planning with Incomplete Information in Quantified Answer Set Programming ⋮ Solving QBF with counterexample guided refinement ⋮ Incremental QBF Solving by DepQBF ⋮ QBFFam: a tool for generating QBF families from proof complexity ⋮ Lower bounds for QCDCL via formula gauge ⋮ Hardness and optimality in QBF proof systems modulo NP ⋮ Proof complexity of symbolic QBF reasoning

This page was built for software: DepQBF