pith. sign in

arxiv: 2005.13406 · v1 · pith:USXQ7B4Unew · submitted 2020-05-27 · 💻 cs.AI

Neural heuristics for SAT solving

classification 💻 cs.AI
keywords heuristicsneuralalgorithmsarchitectureattentionbranchingcomparedenhance
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.