[PDF][PDF] The SAT Museum.

A Biere, M Fleury, N Froleyks… - POS@ SAT, 2023 - cca.informatik.uni-freiburg.de
Abstract The virtual SAT Solver Museum is an effort towards preserving historical SAT
solvers, by collecting and porting their source code to modern compilers and evaluating …

A reinforcement learning based reset policy for cdcl sat solvers

C Li, C Liu, J Chung, P Jha, V Ganesh - arXiv preprint arXiv:2404.03753, 2024 - arxiv.org
Restart policy is an important technique used in modern Conflict-Driven Clause Learning
(CDCL) solvers, wherein some parts of the solver state are erased at certain intervals during …

A new variable ordering for in-processing bounded variable elimination in sat solvers

S Li, CM Li, M Luo, J Coll, D Habet… - 32th International Joint …, 2023 - hal.science
Bounded Variable Elimination (BVE) is an important Boolean formula simplification
technique in which the variable ordering is crucial. We define a new variable ordering based …

Understanding and Improving SAT Solvers via Proof Complexity and Reinforcement Learning

C Li - 2023 - uwspace.uwaterloo.ca
Despite the fact that the Boolean satisfiability (SAT) problem is NP-complete and believed to
be intractable, SAT solvers are routinely used by practitioners to solve hard problems in …

Horn Clause First in Ordered Linear Resolution for the CDCL Solver

ZH Li, GF Wu, Y Xu, J Liu - … Management of Data and Information in …, 2024 - World Scientific
This chapter presents the Horn-First Combinatorial Strategy (HFCS) within the Conflict-
Driven Clause Learning (CDCL) solver framework, which leverages unit propagation to …

[PDF][PDF] New Rephasing Strategies and Their Combinations

J Zheng, M Jin, K He, Z Chen, J Xue - SAT COMPETITION 2023 - helda.helsinki.fi
New Rephasing Strategies and Their Combinations Page 28 New Rephasing Strategies and
Their Combinations Jiongzhi Zheng1, 2 Mingming Jin1, 2 Kun He1, 2 Zhuo Chen1, 2 Jinghui …