Pith. sign in

REVIEW

Neural heuristics for SAT solving

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.13406 v1 pith:USXQ7B4U submitted 2020-05-27 cs.AI

classification cs.AI
keywords heuristicsneuralalgorithmsarchitectureattentionbranchingcomparedenhance
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools