public class OptToPBSATAdapter extends PBSolverDecorator
| Constructor and Description |
|---|
OptToPBSATAdapter(IOptimizationProblem problem) |
OptToPBSATAdapter(IOptimizationProblem problem,
SolutionFoundListener sfl) |
| Modifier and Type | Method and Description |
|---|---|
Number |
getCurrentObjectiveValue()
Return the value of the objective function in the last model found.
|
boolean |
isOptimal() |
boolean |
isSatisfiable() |
boolean |
isSatisfiable(boolean global) |
boolean |
isSatisfiable(IVecInt myAssumps) |
boolean |
isSatisfiable(IVecInt myAssumps,
boolean global) |
int[] |
model() |
boolean |
model(int var) |
int[] |
model(PrintWriter out)
Compute a minimal model according to the objective function of the
IPBProblem decorated.
|
void |
setSolutionFoundListener(SolutionFoundListener sfl) |
void |
setTimeoutForFindingBetterSolution(int seconds)
Allow to set a specific timeout when the solver is in optimization mode.
|
String |
toString(String prefix) |
addAtLeast, addAtLeast, addAtMost, addAtMost, addExactly, addExactly, addPseudoBoolean, getObjectiveFunction, setObjectiveFunctionaddAllClauses, addAtLeast, addAtMost, addBlockingClause, addClause, addExactly, clearDecorated, clearLearntClauses, decorated, expireTimeout, findModel, findModel, getLogPrefix, getSearchListener, getSolvingEngine, getStat, getTimeout, getTimeoutMs, isDBSimplificationAllowed, isSolverKeptHot, isVerbose, modelWithInternalVariables, nConstraints, newVar, newVar, nextFreeVarId, nVars, primeImplicant, primeImplicant, printInfos, printInfos, printStat, printStat, printStat, realNumberOfVariables, registerLiteral, removeConstr, removeSubsumedConstr, reset, setDBSimplificationAllowed, setExpectedNumberOfClauses, setKeepSolverHot, setLogPrefix, setSearchListener, setTimeout, setTimeoutMs, setTimeoutOnConflicts, setUnitClauseProvider, setVerbose, toString, unsatExplanationclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitaddAllClauses, addAtLeast, addAtMost, addBlockingClause, addClause, addExactly, clearLearntClauses, expireTimeout, getLogPrefix, getSearchListener, getSolvingEngine, getStat, getTimeout, getTimeoutMs, isDBSimplificationAllowed, isSolverKeptHot, isVerbose, modelWithInternalVariables, newVar, nextFreeVarId, printStat, printStat, printStat, realNumberOfVariables, registerLiteral, removeConstr, removeSubsumedConstr, reset, setDBSimplificationAllowed, setExpectedNumberOfClauses, setKeepSolverHot, setLogPrefix, setSearchListener, setTimeout, setTimeoutMs, setTimeoutOnConflicts, setUnitClauseProvider, setVerbose, unsatExplanationfindModel, findModel, nConstraints, newVar, nVars, primeImplicant, primeImplicant, printInfos, printInfospublic OptToPBSATAdapter(IOptimizationProblem problem)
public OptToPBSATAdapter(IOptimizationProblem problem, SolutionFoundListener sfl)
public boolean isSatisfiable()
throws TimeoutException
isSatisfiable in interface IProblemisSatisfiable in class SolverDecorator<IPBSolver>TimeoutExceptionpublic boolean isSatisfiable(boolean global)
throws TimeoutException
isSatisfiable in interface IProblemisSatisfiable in class SolverDecorator<IPBSolver>TimeoutExceptionpublic boolean isSatisfiable(IVecInt myAssumps, boolean global) throws TimeoutException
isSatisfiable in interface IProblemisSatisfiable in class SolverDecorator<IPBSolver>TimeoutExceptionpublic boolean isSatisfiable(IVecInt myAssumps) throws TimeoutException
isSatisfiable in interface IProblemisSatisfiable in class SolverDecorator<IPBSolver>TimeoutExceptionpublic int[] model()
model in interface IProblemmodel in class SolverDecorator<IPBSolver>public int[] model(PrintWriter out)
out - a writer to display information in verbose modepublic boolean model(int var)
model in interface RandomAccessModelmodel in class SolverDecorator<IPBSolver>public String toString(String prefix)
toString in interface ISolvertoString in class SolverDecorator<IPBSolver>public boolean isOptimal()
public Number getCurrentObjectiveValue()
public void setTimeoutForFindingBetterSolution(int seconds)
public void setSolutionFoundListener(SolutionFoundListener sfl)
Copyright © 2013 Centre de Recherche en Informatique de Lens (CRIL). All Rights Reserved.