Solving dependency quantified Boolean formulas using quantifier localization
Authors:
- Aile Ge-ErnstAGAile Ge-Ernst
- Christoph SchollCSChristoph Scholl
- Juraj SíčJSJuraj Síč
- Ralf WimmerRWRalf Wimmer
- 28 March 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 925, 1-24
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (SCHO 894/4-1)
- Deutsche Forschungsgemeinschaft (WI 4490/1-1)
- Ministerstvo Školství, Mládeže a Tělovýchovy
This publication has 9 references indexed in Scilit:
- Henkin quantifiers and Boolean formulae: A certification perspective of DQBFTheoretical Computer Science, 2014
- A Highly Fault-Efficient SAT-Based ATPG FlowIEEE Design & Test of Computers, 2012
- Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability AnalysisInternational Journal of Parallel Programming, 2010
- Efficient SAT-based bounded model checking for software verificationTheoretical Computer Science, 2008
- Planning as satisfiability: parallel plans and algorithms for plan searchArtificial Intelligence, 2006
- Bounded Model Checking2003
- Robust Boolean reasoning for equivalence checking and functional property verificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Bounded Model Checking Using Satisfiability SolvingFormal Methods in System Design, 2001
- Lower bounds for multiplayer noncooperative games of incomplete informationComputers & Mathematics with Applications, 2001