|
Last change
on this file since 12147 was
6152,
checked in by bfarka, 14 years ago
|
|
added ecj and custom statistics to communicate with the okb services #1441
|
|
File size:
817 bytes
|
| Line | |
|---|
| 1 | The boolean satisfiability problem can have widly different levels of |
|---|
| 2 | difficulty. To that end, this directory contains three different |
|---|
| 3 | problems. All the problems are 3CNF, and were generated using the Mkcnf |
|---|
| 4 | program from ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/contributed/UCSC/instances/Cnfgen.tar.Z. |
|---|
| 5 | See the README file in that package for instructions on buliding and |
|---|
| 6 | usage. |
|---|
| 7 | |
|---|
| 8 | The three problems included here have 10, 215, and 1000 clauses, and are |
|---|
| 9 | known to be satisfiable. So, the maximum fitness is 10, 215, and 1000. |
|---|
| 10 | All problems have 50 variables (so a genome length of 50). |
|---|
| 11 | |
|---|
| 12 | Note that the problem file is assumed to be in DIMACS format. See |
|---|
| 13 | http://www.satlib.org/Benchmarks/SAT/satformat.ps for more information. |
|---|
| 14 | Mkcnf can generate arbitrary, satisfiable CNF formulas in DIMACS format. |
|---|
| 15 | |
|---|
Note: See
TracBrowser
for help on using the repository browser.
