Fast DQBF Refutation

DOI10.1007/978-3-319-09284-3_19zbMath1423.68447OpenAlexW6137842MaRDI QIDQ3192073

Bernd Finkbeiner, Leander Tentrup

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

Preprocessing for DQBF ⋮ Solving dependency quantified Boolean formulas using quantifier localization ⋮ Building strategies into QBF proofs ⋮ Incremental Determinization ⋮ Dependency Schemes for DQBF ⋮ Lifting QBF Resolution Calculi to DQBF ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers ⋮ Certified DQBF solving by definition extraction ⋮ DQBDD: an efficient BDD-based DQBF solver

This page was built for publication: Fast DQBF Refutation