Neural heuristics for SAT solving

05/27/2020
by   Sebastian Jaszczur, et al.
12

We use neural graph networks with a message-passing architecture and an attention mechanism to enhance the branching heuristic in two SAT-solving algorithms. We report improvements of learned neural heuristics compared with two standard human-designed heuristics.

READ FULL TEXT
research
11/03/2015

SAT as a game

We propose a funny representation of SAT. While the primary interest is ...
research
04/20/2022

Simplicial Attention Networks

Graph representation learning methods have mostly been limited to the mo...
research
02/18/2011

Evolved preambles for MAX-SAT heuristics

MAX-SAT heuristics normally operate from random initial truth assignment...
research
02/12/2012

Message passing for quantified Boolean formulas

We introduce two types of message passing algorithms for quantified Bool...
research
01/31/2013

Efficient Partial Order CDCL Using Assertion Level Choice Heuristics

We previously designed Partial Order Conflict Driven Clause Learning (PO...
research
02/18/2014

Symbiosis of Search and Heuristics for Random 3-SAT

When combined properly, search techniques can reveal the full potential ...
research
08/22/2022

One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction

We propose a universal Graph Neural Network architecture which can be tr...

Please sign up or login with your details

Forgot password? Click here to reset