Author:
Luo Yun-Rong,Cheng Che,Jiang Jie-Hong R.
Funder
Ministry of Science and Technology, Taiwan
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference28 articles.
1. Balabanov, V., Chiang, H.-J.K., Jiang, J.-H.R.: Henkin quantifiers and Boolean formulae: a certification perspective of DQBF. Theor. Comput. Sci. 523, 86–100 (2014)
2. Beyersdorff, O., Chew, L., Schmidt, R.A., Suda, M.: Lifting QBF resolution calculi to DQBF. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 490–499 (2016). Springer
3. Beyersdorff, O., Blinkhorn, J., Mahajan, M.: Building strategies into QBF proofs. J. Autom. Reason. 65, 125–154 (2021)
4. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)
5. Blinkhorn, J., Peitl, T., Slivovsky, F.: Davis and Putnam meet Henkin: solving DQBF with resolution. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 30–46 (2021)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Function Synthesis for Maximizing Model Counting;Lecture Notes in Computer Science;2023-12-30