Evolutionary computing for the satisfiability problem

Authors:
Jin-Kao Hao;Frédéric Lardeux;Frédéric Saubion
Affiliations:
LERIA, Université d'Angers, Angers Cedex;LERIA, Université d'Angers, Angers Cedex;LERIA, Université d'Angers, Angers Cedex
Venue:
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Year:
2003

Citing 14
Cited 5

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Tabu Search

Tabu Search
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics
Evolutionary algorithms for the satisfiability problem

Evolutionary Computation
Using Genetic Algorithms to Solve NP-Complete Problems

Proceedings of the 3rd International Conference on Genetic Algorithms
Theoretical Study of Symmetries in Propositional Calculus and Applications

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Integrating Equivalency Reasoning into Davis-Putnam Procedure

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A backbone-search heuristic for efficient solving of hard 3-SAT formulae

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Tabu search for SAT

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

GASAT: a genetic local search algorithm for the satisfiability problem

Evolutionary Computation
A competitive and cooperative approach to propositional satisfiability

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Fifty-five solvers in vancouver: the SAT 2004 competition

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A multilevel memetic algorithm for large sat-encoded problems

Evolutionary Computation
Finite satisfiability of propositional interval logic formulas with multi-objective evolutionary algorithms

Proceedings of the twelfth workshop on Foundations of genetic algorithms XII

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents GASAT, a hybrid evolutionary algorithm for the satisfiability problem (SAT). A specific crossover operator generates new solutions, that are improved by a tabu search procedure. The performance of GASAT is assessed using a set of well-known benchmarks. Comparisons with state-of-the-art SAT algorithms show that GASAT gives very competitive results. These experiments also allow us to introduce a new SAT benchmark from a coloring problem.