摘要： 文献1：Applying UCT to Boolean Satisfiability 文献2：Monte-Carlo Style UCT Search for Boolean Satisfiability 文献3： 文献1——简要说明。没有介绍基本概念。 UCT repeatedly starts 阅读全文

摘要： Maple_CM_ordUP+, Based on Maple_LCM --Copyright (c) 2018, Chu-Min LI, Mao Luo, Fan Xiao: implementing a clause minimisation approach and selects the c 阅读全文

摘要： A branching heuristic for SAT solvers based on complete implication graphs Xiao, F., Li, C., Luo, M. et al. A branching heuristic for SAT solvers base 阅读全文

摘要： Exponential Recency Weighted Average Branching Heuristic for SAT Solvers Jia Hui Liang, Vijay Ganesh, Pascal Poupart,等. Exponential Recency Weighted A 阅读全文

摘要： Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning keszocze O., Schmitz K., Schloeter J., Drechsler R. (2020) Improving SAT Sol 阅读全文

摘要： Learning Rate Based Branching Heuristic for SAT Solvers Liang J.H., Ganesh V., Poupart P., Czarnecki K. (2016) Learning Rate Based Branching Heuristic 阅读全文

摘要： 文献名称 CDCL Solver Additions: Local Look-Ahead,All-Unit-UIP Learning and On-the-Fly Probing Norbert Manthey:CDCL Solver Additions: Local Look-Ahead, All 阅读全文

该文被密码保护。 阅读全文

摘要： Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics Chowdhury M.S., Müller M., You JH. (2019) Exploiting Glue Clauses to Design Effe 阅读全文

摘要： An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate Liang J.H., V.K. H.G., Poupart P., Czarnecki K., Ganesh V. (2017) 阅读全文