Seguir
Benjamin Böhm
Benjamin Böhm
Dirección de correo verificada de uni-jena.de
Título
Citado por
Citado por
Año
Understanding the relative strength of QBF CDCL solvers and QBF resolution
O Beyersdorff, B Böhm
Logical Methods in Computer Science 19, 2023
112023
Lower bounds for QCDCL via formula gauge
B Böhm, O Beyersdorff
Journal of Automated Reasoning 67 (4), 35, 2023
62023
QCDCL with cube learning or pure literal elimination-what is best?
B Böhm, T Peitl, O Beyersdorff
Proc. of the 31st Int. Joint Conf. on Artificial Intelligence (IJCAI 2022 …, 2022
32022
Should Decisions in QCDCL Follow Prefix Order?
B Böhm, T Peitl, O Beyersdorff
25th International Conference on Theory and Applications of Satisfiability …, 2022
32022
QCDCL vs QBF Resolution: Further Insights
B Böhm, O Beyersdorff
26th International Conference on Theory and Applications of Satisfiability …, 2023
2023
3.6 CDCL vs resolution: the picture in QBF
B Böhm
Theory and Practice of SAT and Combinatorial Solving, 94, 0
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–6