Publisher
Springer International Publishing
Reference35 articles.
1. Balabanov, V., Roland Jiang, J.-H.: Reducing satisfiability and reachability to DQBF, 2015. Talk given at International Workshop on Quantified Boolean Formulas - QBF 2015 (2015)
2. Beyer, D., Löwe, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transf. 21(1), 1–29 (2017). https://doi.org/10.1007/s10009-017-0469-y
3. Biere, A.: Picosat essentials. J. Satisfiability, Boolean Model. Comput. (JSAT). 4, 75–97 (2008)
4. Bloem, R., Könighofer, R., Seidl, M.: SAT-based synthesis methods for safety specs. In: Verification, Model Checking, and Abstract Interpretation, pp. 1–20 (2014)
5. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677–691 (1986)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Synthesis with Explicit Dependencies;2023 Design, Automation & Test in Europe Conference & Exhibition (DATE);2023-04
2. What’s New In QBF Solving? : (Invited Talk);2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09
3. Solving dependency quantified Boolean formulas using quantifier localization;Theoretical Computer Science;2022-08
4. Reducing NEXP-complete problems to DQBF;Form Comp Aid Design;2022