DQBDD: an efficient BDD-based DQBF solver

DOI10.1007/978-3-030-80223-3_36OpenAlexW3186962925MaRDI QIDQ2118347

Jan Strejček, Juraj Síč

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_36

Mathematics Subject Classification ID

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

Related Items (1)

Solving dependency quantified Boolean formulas using quantifier localization

Uses Software

• CUDD
• PicoSAT
• iProver
• antom
• HQSpre
• Q3B
• dCAQE

Cites Work

• Unnamed Item
• Unnamed Item
• From DQBF to QBF by dependency elimination
• Clausal abstraction for DQBF
• Interpolation-based semantic gate extraction and its applications to QBF preprocessing
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
• SAT-Based Synthesis Methods for Safety Specs
• Fast DQBF Refutation
• iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
• Graph-Based Algorithms for Boolean Function Manipulation
• The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
• Lower bounds for multiplayer noncooperative games of incomplete information

This page was built for publication: DQBDD: an efficient BDD-based DQBF solver