public class SAT extends Problem implements SimpleProblemForm
Parameters
| base.sat-filename String |
(Filename containing boolean satisfiability formula in Dimacs CNF format) |
| Modifier and Type | Class and Description |
|---|---|
static class |
SAT.Clause
Private helper class holding a single clause in the boolean formula.
|
| Modifier and Type | Field and Description |
|---|---|
(package private) SAT.Clause[] |
formula |
static String |
P_FILENAME |
private static long |
serialVersionUID |
| Constructor and Description |
|---|
SAT() |
| Modifier and Type | Method and Description |
|---|---|
void |
evaluate(EvolutionState state,
Individual ind,
int subpopulation,
int threadnum)
Evalutes the individual using the MAXSAT fitness function.
|
void |
setup(EvolutionState state,
Parameter base)
Sets up the object by reading it from the parameters stored
in state, built off of the parameter base base.
|
canEvaluate, clone, closeContacts, defaultBase, describe, describe, finishEvaluating, initializeContacts, prepareToEvaluate, reinitializeContactsequals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitdescribeprivate static final long serialVersionUID
public static final String P_FILENAME
SAT.Clause[] formula
public void setup(EvolutionState state, Parameter base)
PrototypeFor prototypes, setup(...) is typically called once for the prototype instance; cloned instances do not receive the setup(...) call. setup(...) may be called more than once; the only guarantee is that it will get called at least once on an instance or some "parent" object from which it was ultimately cloned.
public void evaluate(EvolutionState state, Individual ind, int subpopulation, int threadnum)
evaluate in interface SimpleProblemFormCopyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.