Kissat-MAB-rephasing and Kissat_relaxed

Xinyan Chen, Wenxuan Guo, Wanqian Luo, Hui-Ling Zhen, Xijun Li, Mingxuan Yuan, Junchi Yan

Abstract: We introduce two Kissat-based SAT solvers in this report, i.e., Kissat-MAB-rephasing and Kissat_relaxed. The idea of these solvers falls into two categories: 1) devising a multi-armed bandit mechanism to select rephasing schemes, and 2) embedding local search into the CDCL solving process to explore solutions near promising branches in the search space. The solvers are based on Kissat and Kissat-cf, respectively.