paper-with-me

홈 › Papers

Guiding High-Performance SAT Solvers with Unsat-Core Predictions

2019-03-12 · Daniel Selsam, Nikolaj Bjørner

The NeuroSAT neural network architecture was recently introduced for predicting properties of propositional formulae. When trained to predict the satisfiability of toy problems, it was shown to find solutions and unsatisfiable cores on its own. However, the authors saw "no obvious path" to using the architecture to improve the state-of-the-art. In this work, we train a simplified NeuroSAT architecture to directly predict the unsatisfiable cores of real problems. We modify several high-performance SAT solvers to periodically replace their variable activity scores with NeuroSAT's prediction of how likely the variables are to appear in an unsatisfiable core. The modified MiniSat solves 10% more problems on SAT-COMP 2018 within the standard 5,000 second timeout than the original does. The modified Glucose solves 11% more problems than the original, while the modified Z3 solves 6% more. The gains are even greater when the training is specialized for a specific distribution of problems; on a benchmark of hard problems from a scheduling domain, the modified Glucose solves 20% more problems than the original does within a one-hour timeout. Our results demonstrate that NeuroSAT can provide effective guidance to high-performance SAT solvers on real problems.

📄 PDF Abstract BibTeX arXiv:1903.04671

Code (1)

dselsam/neurocore-public 공식 구현 tf

Tasks

SchedulingVocal Bursts Intensity Prediction

Similar Papers 제목 키워드 기반

Unsatisfiable Cores for Constraint Programming

2013-05-08 · Nicholas Downing, Thibaut Feydy, Peter J. Stuckey

Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, espe…

Unsatisfiable Cores and Lower Bounding for Constraint Programming

2015-08-25 · Nicholas Downing, Thibaut Feydy, Peter J. Stuckey

Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, espe…

SATformer: Transformer-Based UNSAT Core Learning

2022-09-02 · Zhengyuan Shi, Min Li, Yi Liu, Sadaf Khan 외

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 …

Graph Neural NetworkMulti-Task Learning

IB-Net: Initial Branch Network for Variable Decision in Boolean Satisfiability

2024-03-06 · Tsz Ho Chan, Wenyi Xiao, Junhua Huang, HuiLing Zhen 외

Boolean Satisfiability problems are vital components in Electronic Design Automation, particularly within the Logic Equivalence Checking process. Currently, SAT solvers are employed for these problems and neural network …

Enhancing SAT solvers with glue variable predictions

2020-07-06 · Jesse Michael Han

Modern SAT solvers routinely operate at scales that make it impractical to query a neural network for every branching decision. NeuroCore, proposed by Selsam and Bjorner, offered a proof-of-concept that neural networks c…

CPUGPUreinforcement-learningReinforcement Learning+1