Evolutionary algorithms for the satisfiability problem

  • Authors:
  • Jens Gottlieb;Elena Marchiori;Claudio Rossi

  • Affiliations:
  • SAP AG, Neurottstrasse 16, 69190 Walldorf, Germany;Department of Computer Science, Free University Amsterdam, de Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands;Department of Computer Science, Ca' Foscari University of Venice, Via Torino 155, 31072 Mestre, Italy

  • Venue:
  • Evolutionary Computation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several evolutionary algorithms have been proposed for the satisfiability problem. We review the solution representations suggested in literature and choose the most promising one - the bit string representation - for further evaluation. An empirical comparison on commonly used benchmarks is presented for the most successful evolutionary algorithms and for WSAT, a prominent local search algorithm for the satisfiability problem. The key features of successful evolutionary algorithms are identified, thereby providing useful methodological guidelines for designing new heuristics. Our results indicate that evolutionary algorithms are competitive to WSAT.