2025/07/17 by Eugene P. Goldberg, Goldberg, Eugene
Computer Science · #Constraint Satisfaction and Optimization #Data Management and Algorithms #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Optimization and Search Problems
paper · pdf · doi:10.48550/arxiv.2507.13282
openalex publication_date 2025/07/17 · openalex created_date 2025/10/18 · openalex updated_date 2026/07/28
Earlier we introduced the notion of a stable set of points (SSP). We proved that a CNF formula is unsatisfiable iff there is a set of points (i.e. complete assignments) that is stable with respect to this formula. Experiments showed that SSPs for CNF formulas of practical interest are very large. So computing an SSP for a CNF formula point by point is, in general, infeasible. In this report, we show how an SSP can be computed in clusters, each cluster being a large set of points that are processed simultaneously. The appeal of computing SSPs is twofold. First, it allows one to better take into account formula structure and hence, arguably, design more efficient SAT algorithms. Second, SAT solving by SSPs facilitates parallel computing.