Author:
Reichl Franz-Xaver,Slivovsky Friedrich,Szeider Stefan
Publisher
Springer International Publishing
Reference52 articles.
1. Lecture Notes in Computer Science;S Akshay,2018
2. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 399–404 (2009)
3. Azhar, S., Peterson, G., Reif, J.: Lower bounds for multiplayer non-cooperative games of incomplete information. J. Comput. Math. Appl. 41, 957–992 (2001)
4. Balabanov, V., Chiang, H.K., Jiang, J.R.: Henkin quantifiers and boolean formulae: a certification perspective of DQBF. Theor. Comput. Sci. 523, 86–100 (2014)
5. Baldoni, R., Coppa, E., D’Elia, D.C., Demetrescu, C., Finocchi, I.: A survey of symbolic execution techniques. ACM Comput. Surv. 51(3), 50:1–50:39 (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Resolution Proof System for Dependency Stochastic Boolean Satisfiability;Journal of Automated Reasoning;2023-08-03
2. Synthesis with Explicit Dependencies;2023 Design, Automation & Test in Europe Conference & Exhibition (DATE);2023-04
3. Mining definitions in Kissat with Kittens;Formal Methods in System Design;2022-06