DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
From MaRDI portal
Publication:2405263
DOI10.1007/978-3-319-63046-5_23zbMath1494.68288arXiv1702.08256OpenAlexW2949458057MaRDI QIDQ2405263
Publication date: 22 September 2017
Full work available at URL: https://arxiv.org/abs/1702.08256
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (18)
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Proof complexity of modal resolution ⋮ Relating size and width in variants of Q-resolution ⋮ OuterCount: a first-level solution-counter for quantified Boolean formulas ⋮ True crafted formula families for benchmarking quantified satisfiability solvers ⋮ Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution ⋮ Tackling universal properties of minimal trap spaces of Boolean networks ⋮ Computing smallest MUSes of quantified Boolean formulas ⋮ Lower bounds for QCDCL via formula gauge ⋮ Solving Advanced Argumentation Problems with Answer Set Programming ⋮ 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 ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers ⋮ Planning with Incomplete Information in Quantified Answer Set Programming ⋮ QBFFam: a tool for generating QBF families from proof complexity ⋮ Lower bounds for QCDCL via formula gauge
Uses Software
This page was built for publication: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
