Evolved preambles for MAX-SAT heuristics

02/18/2011
by   Luis O. Rigo Jr, et al.
0

MAX-SAT heuristics normally operate from random initial truth assignments to the variables. We consider the use of what we call preambles, which are sequences of variables with corresponding single-variable assignment actions intended to be used to determine a more suitable initial truth assignment for a given problem instance and a given heuristic. For a number of well established MAX-SAT heuristics and benchmark instances, we demonstrate that preambles can be evolved by a genetic algorithm such that the heuristics are outperformed in a significant fraction of the cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2022

NP^#P = ∃PP and other remarks about maximized counting

We consider the following decision problem DMAX#SAT, and generalizations...
research
05/27/2020

Neural heuristics for SAT solving

We use neural graph networks with a message-passing architecture and an ...
research
06/26/2023

A Note On The Natural Range Of Unambiguous-SAT

We discuss the natural range of the Unambiguous-SAT problem with respect...
research
09/22/2020

On the Mysteries of MAX NAE-SAT

MAX NAE-SAT is a natural optimization problem, closely related to its be...
research
11/27/2018

Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem

We study spectral approaches for the MAX-2-LIN(k) problem, in which we a...
research
05/09/2018

Revisiting Decision Diagrams for SAT

Symbolic variants of clause distribution using decision diagrams to elim...
research
02/17/2020

Generating clause sequences of a CNF formula

Given a CNF formula Φ with clauses C_1,...,C_m and variables V={x_1,...,...

Please sign up or login with your details

Forgot password? Click here to reset