SATformer: Transformer-Based UNSAT Core Learning

Abstract

This paper introduces SATformer, a novel Transformer-based approach for the Boolean Satisfiability (SAT) problem. Rather than solving the problem directly, SATformer approaches the problem from the opposite direction by focusing on unsatisfiability. Specifically, it models clause interactions to identify any unsatisfiable sub-problems. Using a graph neural network, we convert clauses into clause embeddings and employ a hierarchical Transformer-based model to understand clause correlation. SATformer is trained through a multi-task learning approach, using the single-bit satisfiability result and the minimal unsatisfiable core (MUC) for UNSAT problems as clause supervision. As an end-to-end learning-based satisfiability classifier, the performance of SATformer surpasses that of NeuroSAT significantly. Furthermore, we integrate the clause predictions made by SATformer into modern heuristic-based SAT solvers and validate our approach with a logic equivalence checking task. Experimental results show that our SATformer can decrease the runtime of existing solvers by an average of 21.33%.

References in corpus (8)

• Adam: A Method for Stochastic Optimization
• An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
• Learning a SAT Solver from Single-Bit Supervision
• Algorithm Selection as a Bandit Problem with Unbounded Losses
• NLocalSAT: Boosting Local Search with Solution Prediction
• Machine Learning Methods in Solving the Boolean Satisfiability Problem
• ReadNet: A Hierarchical Transformer Framework for Web Article Readability Analysis
• DeepSAT: An EDA-Driven Learning Framework for SAT