Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications

DOI10.1007/978-3-319-94144-8_1MaRDI QIDQ5889312zbMATH OpenOpenAlexFDO

Authors Christoph Scholl, Ralf Wimmer

Publication date 20 April 2023

Published in Theory and Applications of Satisfiability Testing – SAT 2018 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-94144-8_1

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Solving dependency quantified Boolean formulas using quantifier localization
• Dependency learning for QBF
• From DQBF to QBF by dependency elimination
• Dependency Learning for QBF
• Dependency schemes for DQBF

Cited in

(14)

• A resolution-style proof system for DQBF
• From DQBF to QBF by dependency elimination
• DQBDD: an efficient BDD-based DQBF solver
• Solving dependency quantified Boolean formulas using quantifier localization
• Clausal abstraction for DQBF
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
• Henkin quantifiers and Boolean formulae
• Building strategies into QBF proofs
• Theory and Applications of Satisfiability Testing
• Dependency Quantified Horn Formulas: Models and Complexity
• A resolution proof system for dependency stochastic Boolean satisfiability
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
• Dependency schemes in CDCL-based QBF solving: a proof-theoretic study
• Strong (D)QBF dependency schemes via implication-free resolution paths

This page was built for publication: Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889312)