摘要： Unit Clause Small Clause Current Partial Assignment Clause Database Clause Sharing 对并行求解的理解：并行主要采用组合投资方式或分而治之理论策略。 （1）对已分治策略详见Non-Portfolio approaches 阅读全文

摘要： CADICAL, KISSAT, PARACOOBA, PLINGELING and TREENGELING Entering the SAT Competition 2020 Armin Biere Katalin Fazekas Mathias Fleury Maximilian Heising 阅读全文

摘要： Centrality-Based Improvements to CDCL Heuristics Abstract There are many reasons to think that SAT solvers should be able to exploit formula structure 阅读全文

摘要： Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies Vijay Durairaj and Priyank KallaDepartment of Electrical and 阅读全文

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

摘要： Clause vivification by unit propagation in CDCL SAT solvers 提出了一种子句复活方法，通过应用单元传播来消除冗余文字. Abstract Original and learnt clauses in Conflict-Driven Claus 阅读全文

摘要： Structure and Dynamics of Information Pathways in Online Media 找出持久的话题和底层网络 ABSTRACT Diffusion of information, spread of rumors and infectious disease 阅读全文

摘要： SAT-Solving Based on Boundary Point Elimination Goldberg E., Manolios P. (2011) SAT-Solving Based on Boundary Point Elimination. In: Barner S., Harris 阅读全文

摘要： 要点：使用DMRP algorithm (decision making with a reference point)在重启阶段为解决问题提供好的方向。 引文来自： Kottler S. (2010) SAT Solving with Reference Points. In: Strichman 阅读全文

摘要： Ternary Tree Solver (tts-4-0) Ivor Spence School of Electronics, Electrical Engineering and Computer Science Queen’s University Belfast i.spence@qub.a 阅读全文