SAT INSTANCES

 

I have been asked by many authors to provide the instances we used in our work on the Satisfiability (SAT) problem [1][2][3][4]. Find them below. Note that the material provided is intellectual property of their respective authors and/or institutions, that shall be cited accordingly.


  1. •SAT Instances.zip


This compressed file contains a selection of SAT ad 3SAT instances, mainly in CNF form, of the following "families" (see [1] and [5] for an explanation):

  1. •1-12

  2. •Aim

  3. •II

  4. •dejong

  5. •Jhn

  6. •Par

  7. •n20-100



References

1. J. Gottlieb, E. Marchiori, C. Rossi

"Evolutionary Algorithms for the Satisfiability Problem"

Evolutionary Computation, MIT Press, Vol. 10, Nr. 1, pp. 35-50, 2002.


2. C. Rossi, E.Marchiori, J.N.Kok,

"An Adaptive Evolutionary Algorithm for the Satisfiability Problem",

2000 ACM Symposium on Applied Computing (SAC2000), 2000,Como, Italy, 2000.


3. E. Marchiori, C. Rossi,

"A Flipping Genetic Algorithm for Hard 3-SAT Problems"

Genetic and Evolutionary Computation Conference (GECCO), Orlando, Florida, 1999.


  1. 4. P. San Segundo, D. Rodriguez-Losada, C. Rossi

"Recent developments in bit-parallel algorithms"

In A. Lazinicka, (Ed.) "Tools for Artificial Intelligence", (2008).


5. Resende, M. and Feo, T. (1996). A GRASP for satisfiability. In Trick, M. and Johnson, D. S., editors (1996). Second DIMACS Challenge, special issue, Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 499-520, AMS, Providence, Rhode Island.