GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem | Zendy

Frédéric Lardeux | Zendy; Frédéric Saubion | Zendy; JinKao Hao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem

Author(s) -

Frédéric Lardeux,

Frédéric Saubion,

JinKao Hao

Publication year - 2006

Publication title -

evolutionary computation

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.732

H-Index - 82

eISSN - 1530-9304

pISSN - 1063-6560

DOI - 10.1162/evco.2006.14.2.223

Subject(s) - tabu search , crossover , local search (optimization) , satisfiability , algorithm , genetic algorithm , boolean satisfiability problem , search algorithm , feature (linguistics) , maximum satisfiability problem , guided local search , computer science , mathematical optimization , state (computer science) , mathematics , artificial intelligence , boolean function , linguistics , philosophy

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research