DQBDD: an efficient BDD-based DQBF solver
From MaRDI portal
Publication:2118347
DOI10.1007/978-3-030-80223-3_36OpenAlexW3186962925MaRDI QIDQ2118347FDOQ2118347
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_36
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)
Cites Work
- Title not available (Why is that?)
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- SAT-Based Synthesis Methods for Safety Specs
- Lower bounds for multiplayer noncooperative games of incomplete information
- iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
- From DQBF to QBF by dependency elimination
- Clausal abstraction for DQBF
- Fast DQBF Refutation
- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- Interpolation-based semantic gate extraction and its applications to QBF preprocessing
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1
- Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
Cited In (1)
Uses Software
This page was built for publication: DQBDD: an efficient BDD-based DQBF solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118347)
