2026· International Conference on Theory and Applications of Satisfiability Testing· pp. 21:1-21:18· 0 citations· 23 references
Computer Science
TL;DR
The PALSAT (Progressive Activation Local Search for SAT) incomplete solver is proposed, which integrates the core techniques from both sides, Unit Propagation (UP) and LS, and leads to some promising results.
A cardinality-aware local search framework to solve SAT with cardinality constraints, denoted as CardSAT-LS, which integrates a preprocessing phase based on the generalized unit propagation and resolution, a cardinality-sensitive scoring function combining the make-break mechanism and cardinality violation, and an init...
Shu-Li Hu, Dian Ling, Jia-Qi Li et al.· Proceedings of the Thirty-Fi...· 0 citations
This work proposes an end-to-end approach for handcrafted Feature-Free SAT Solver Selection, called F2S3, which effectively captures the structural complexity of graph data, eliminates the need for handcrafted features, and improves feature representation in the low-dimensional space.
Yitao Zhang, Xiao Yang, Yong Lai et al.· Proceedings of the 32nd ACM...· 0 citations
The Boolean satisfiability (SAT) problem is fundamental in applications such as verification and scheduling, where fast solving is often required. However, the performance of SAT solvers varies significantly across instances, making solver selection an important challenge. Previous studies have commonly employed random...
Takeru Nagahama, Tomohisa Kawakami, Tomoyasu Shimada et al.· IEEE International Conferenc...· 0 citations
This paper revisits previous work on ER, which factors out repeated parts of learned clauses during conflict analysis, and explores how their original strategy benefits from 15 years of improvements in the state-of-the-art solver CaDiCaL, and proposes a new, less intrusive inprocessing approach based on factoring XOR a...
Florian Pollitt, Zachary Battleman, Mathias Fleury et al.· International Conference on...· 1 citation
This work presents the first systematic analysis of how leading LCG solvers maintain their SAT encodings, based on source-code inspection and developer correspondence, and proposes a native CDCL framework for CP, replacing SAT literals with atomic constraints, enabling conflict analysis, nogood learning, and nogood pro...