public class IncrementalBasicAlgorithm extends AbstractAlgorithm
Modifier and Type | Field and Description |
---|---|
protected boolean |
finished |
Constructor and Description |
---|
IncrementalBasicAlgorithm() |
Modifier and Type | Method and Description |
---|---|
CnfSatInstance |
findAMuse(AlgorithmData data) |
boolean |
isFinished()
is the MUS calculated?
|
static void |
main(java.lang.String[] arg0)
Simple testfunction for this algorithm.
|
boolean |
nextStep(int clauseIndex,
AlgorithmData data) |
boolean |
selectNext(int clauseID,
AlgorithmData data)
runs the next step of this algorithm
precondition: this.instance.getSize() > 0
|
nextStep, solve, solve, solve
public boolean isFinished()
public boolean selectNext(int clauseID, AlgorithmData data) throws java.util.concurrent.TimeoutException, java.io.IOException
clauseIndex
- the index of the clause that should be handled next.java.io.IOException
java.lang.InterruptedException
java.util.concurrent.TimeoutException
public static void main(java.lang.String[] arg0) throws java.util.concurrent.TimeoutException, java.lang.InterruptedException, java.io.IOException
java.io.IOException
java.lang.InterruptedException
java.util.concurrent.TimeoutException
public CnfSatInstance findAMuse(AlgorithmData data)
findAMuse
in class AbstractAlgorithm
public boolean nextStep(int clauseIndex, AlgorithmData data)
nextStep
in class AbstractAlgorithm