public abstract class SolverDecorator<T extends ISolver> extends Object implements ISolver
| Constructor and Description |
|---|
SolverDecorator(T solver) |
| Modifier and Type | Method and Description |
|---|---|
void |
addAllClauses(IVec<IVecInt> clauses)
Create clauses from a set of set of literals.
|
IConstr |
addAtLeast(IVecInt literals,
int degree)
Create a cardinality constraint of the type "at least n of those literals
must be satisfied"
|
IConstr |
addAtMost(IVecInt literals,
int degree)
Create a cardinality constraint of the type "at most n of those literals
must be satisfied"
|
IConstr |
addBlockingClause(IVecInt literals)
Add a clause in order to prevent an assignment to occur.
|
IConstr |
addClause(IVecInt literals)
Create a clause from a set of literals The literals are represented by
non null integers such that opposite literals a represented by opposite
values.
|
IConstr |
addExactly(IVecInt literals,
int n)
Create a cardinality constraint of the type
"exactly n of those literals must be satisfied".
|
T |
clearDecorated()
Method to be called to clear the decorator from its decorated solver.
|
void |
clearLearntClauses()
Remove clauses learned during the solving process.
|
T |
decorated() |
void |
expireTimeout()
Expire the timeout of the solver.
|
int[] |
findModel()
Look for a model satisfying all the clauses available in the problem.
|
int[] |
findModel(IVecInt assumps)
Look for a model satisfying all the clauses available in the problem.
|
String |
getLogPrefix() |
<S extends ISolverService> |
getSearchListener()
Get the current SearchListener.
|
ISolver |
getSolvingEngine()
Retrieve the real engine in case the engine is decorated by one or
several decorator.
|
Map<String,Number> |
getStat()
To obtain a map of the available statistics from the solver.
|
int |
getTimeout()
Useful to check the internal timeout of the solver.
|
long |
getTimeoutMs()
Useful to check the internal timeout of the solver.
|
boolean |
isDBSimplificationAllowed()
Indicate whether the solver is allowed to simplify the formula by
propagating the truth value of top level satisfied variables.
|
boolean |
isSatisfiable()
Check the satisfiability of the set of constraints contained inside the
solver.
|
boolean |
isSatisfiable(boolean global)
Check the satisfiability of the set of constraints contained inside the
solver.
|
boolean |
isSatisfiable(IVecInt assumps)
Check the satisfiability of the set of constraints contained inside the
solver.
|
boolean |
isSatisfiable(IVecInt assumps,
boolean global)
Check the satisfiability of the set of constraints contained inside the
solver.
|
boolean |
isSolverKeptHot()
Ask to the solver if it is in "hot" mode, meaning that the heuristics is
not reset after call is isSatisfiable().
|
boolean |
isVerbose()
To know if the solver is in verbose mode (output allowed) or not.
|
int[] |
model()
Provide a model (if any) for a satisfiable formula.
|
boolean |
model(int var)
Provide the truth value of a specific variable in the model.
|
int[] |
modelWithInternalVariables()
That method is designed to be used to retrieve the real model of the
current set of constraints, i.e. to provide the truth value of boolean
variables used internally in the solver (for encoding purposes for
instance).
|
int |
nConstraints()
To know the number of constraints currently available in the solver.
|
int |
newVar()
Deprecated.
|
int |
newVar(int howmany)
Declare
howmany variables in the problem (and thus in the
vocabulary), that will be represented using the Dimacs format by integers
ranging from 1 to howmany. |
int |
nextFreeVarId(boolean reserve)
Ask the solver for a free variable identifier, in Dimacs format (i.e. a
positive number).
|
int |
nVars()
To know the number of variables used in the solver as declared by
newVar()
In case the method newVar() has not been used, the method returns the
number of variables used in the solver.
|
int[] |
primeImplicant()
Provide a prime implicant, i.e. a set of literal that is sufficient to
satisfy all constraints of the problem.
|
boolean |
primeImplicant(int p)
Check if a given literal is part of the prime implicant computed by the
IProblem.primeImplicant() method. |
void |
printInfos(PrintWriter out)
To print additional informations regarding the problem.
|
void |
printInfos(PrintWriter out,
String prefix)
To print additional informations regarding the problem.
|
void |
printStat(PrintStream out,
String prefix)
Deprecated.
|
void |
printStat(PrintWriter out)
Display statistics to the given output writer
|
void |
printStat(PrintWriter out,
String prefix)
Display statistics to the given output writer
|
int |
realNumberOfVariables()
Retrieve the real number of variables used in the solver.
|
void |
registerLiteral(int p)
Tell the solver to consider that the literal is in the CNF.
|
boolean |
removeConstr(IConstr c)
Remove a constraint returned by one of the add method from the solver.
|
boolean |
removeSubsumedConstr(IConstr c)
Remove a constraint returned by one of the add method from the solver
that is subsumed by a constraint already in the solver or to be added to
the solver.
|
void |
reset()
Clean up the internal state of the solver.
|
void |
setDBSimplificationAllowed(boolean status)
Set whether the solver is allowed to simplify the formula by propagating
the truth value of top level satisfied variables.
|
void |
setExpectedNumberOfClauses(int nb)
To inform the solver of the expected number of clauses to read.
|
void |
setKeepSolverHot(boolean value)
Changed the behavior of the SAT solver heuristics between successive
calls.
|
void |
setLogPrefix(String prefix)
Set the prefix used to display information.
|
<S extends ISolverService> |
setSearchListener(SearchListener<S> sl)
Allow the user to hook a listener to the solver to be notified of the
main steps of the search process.
|
void |
setTimeout(int t)
To set the internal timeout of the solver.
|
void |
setTimeoutMs(long t)
To set the internal timeout of the solver.
|
void |
setTimeoutOnConflicts(int count)
To set the internal timeout of the solver.
|
void |
setUnitClauseProvider(UnitClauseProvider ucp)
Allow the solver to ask for unit clauses before each restarts.
|
void |
setVerbose(boolean value)
Set the verbosity of the solver
|
String |
toString() |
String |
toString(String prefix)
Display a textual representation of the solver configuration.
|
IVecInt |
unsatExplanation()
Retrieve an explanation of the inconsistency in terms of assumption
literals.
|
public SolverDecorator(T solver)
public boolean isDBSimplificationAllowed()
ISolverisDBSimplificationAllowed in interface ISolverpublic void setDBSimplificationAllowed(boolean status)
ISolversetDBSimplificationAllowed in interface ISolverpublic void setTimeoutOnConflicts(int count)
ISolversetTimeoutOnConflicts in interface ISolvercount - the timeout (in number of conflicts)public void printInfos(PrintWriter out, String prefix)
IProblemprintInfos in interface IProblemout - the place to print the informationprefix - the prefix to put in front of each linepublic void printInfos(PrintWriter out)
IProblemprintInfos in interface IProblemout - the place to print the information#setLogPrefix(String)public boolean isSatisfiable(boolean global)
throws TimeoutException
IProblemisSatisfiable in interface IProblemglobal - whether that call is part of a global process (i.e.
optimization) or not. if (global), the timeout will not be
reset between each call.TimeoutExceptionpublic boolean isSatisfiable(IVecInt assumps, boolean global) throws TimeoutException
IProblemisSatisfiable in interface IProblemassumps - a set of literals (represented by usual non null integers in
Dimacs format).global - whether that call is part of a global process (i.e.
optimization) or not. if (global), the timeout will not be
reset between each call.TimeoutExceptionpublic void clearLearntClauses()
ISolverclearLearntClauses in interface ISolverpublic int[] findModel()
throws TimeoutException
IProblem
if (isSatisfiable()) {
return model();
}
return null;
findModel in interface IProblemnull if no model is foundTimeoutException - if a model cannot be found within the given timeout.public int[] findModel(IVecInt assumps) throws TimeoutException
IProblem
if (isSatisfiable(assumpt)) {
return model();
}
return null;
findModel in interface IProblemnull if no model is foundTimeoutException - if a model cannot be found within the given timeout.public boolean model(int var)
RandomAccessModelmodel in interface RandomAccessModelvar - the variable id in Dimacs format#model()public void setExpectedNumberOfClauses(int nb)
ISolverp cnf line is
read in dimacs formatted input file.
Note that this method is supposed to be called AFTER a call to
newVar(int)setExpectedNumberOfClauses in interface ISolvernb - the expected number of clauses.IProblem.newVar(int)public int getTimeout()
ISolvergetTimeout in interface ISolverpublic long getTimeoutMs()
ISolvergetTimeoutMs in interface ISolverpublic String toString(String prefix)
ISolver@Deprecated public void printStat(PrintStream out, String prefix)
ISolverprintStat in interface ISolverprefix - the prefix to put in front of each lineISolver.printStat(PrintWriter, String)public void printStat(PrintWriter out, String prefix)
ISolverpublic void printStat(PrintWriter out)
ISolverprintStat in interface ISolverISolver.setLogPrefix(String)@Deprecated public int newVar()
ISolverpublic int newVar(int howmany)
IProblemhowmany variables in the problem (and thus in the
vocabulary), that will be represented using the Dimacs format by integers
ranging from 1 to howmany. That feature allows encodings to create
additional variables with identifier starting at howmany+1.newVar in interface IProblemhowmany - number of variables to createIProblem.nVars()public IConstr addClause(IVecInt literals) throws ContradictionException
ISolveraddClause in interface ISolverliterals - a set of literalsContradictionException - iff the vector of literals is empty or if it contains only
falsified literals after unit propagationISolver.removeConstr(IConstr)public void addAllClauses(IVec<IVecInt> clauses) throws ContradictionException
ISolveraddAllClauses in interface ISolverclauses - a vector of set (VecInt) of literals in the dimacs format. The
vector can be reused since the solver is not supposed to keep
a reference to that vector.ContradictionException - iff the vector of literals is empty or if it contains only
falsified literals after unit propagationISolver.addClause(IVecInt)public IConstr addBlockingClause(IVecInt literals) throws ContradictionException
ISolveraddBlockingClause in interface ISolverContradictionExceptionpublic IConstr addAtMost(IVecInt literals, int degree) throws ContradictionException
ISolveraddAtMost in interface ISolverliterals - a set of literals The vector can be reused since the solver is
not supposed to keep a reference to that vector.degree - the degree (n) of the cardinality constraintContradictionException - iff the vector of literals is empty or if it contains more
than degree satisfied literals after unit propagationISolver.removeConstr(IConstr)public IConstr addAtLeast(IVecInt literals, int degree) throws ContradictionException
ISolveraddAtLeast in interface ISolverliterals - a set of literals. The vector can be reused since the solver
is not supposed to keep a reference to that vector.degree - the degree (n) of the cardinality constraintContradictionException - iff the vector of literals is empty or if degree literals are
not remaining unfalsified after unit propagationISolver.removeConstr(IConstr)public int[] model()
IProblemmodel in interface IProblemIProblem.isSatisfiable(),
IProblem.isSatisfiable(IVecInt)public boolean isSatisfiable()
throws TimeoutException
IProblemisSatisfiable in interface IProblemTimeoutExceptionpublic boolean isSatisfiable(IVecInt assumps) throws TimeoutException
IProblemisSatisfiable in interface IProblemassumps - a set of literals (represented by usual non null integers in
Dimacs format).TimeoutExceptionpublic void setTimeout(int t)
ISolversetTimeout in interface ISolvert - the timeout (in s)public void setTimeoutMs(long t)
ISolversetTimeoutMs in interface ISolvert - the timeout (in milliseconds)public void expireTimeout()
ISolverexpireTimeout in interface ISolverpublic int nConstraints()
IProblemnConstraints in interface IProblempublic int nVars()
IProblemnVars in interface IProblemIProblem.newVar(int)public void reset()
ISolverpublic T decorated()
public T clearDecorated()
public boolean removeConstr(IConstr c)
ISolverremoveConstr in interface ISolverc - a constraint returned by one of the add method.public Map<String,Number> getStat()
ISolverpublic <S extends ISolverService> void setSearchListener(SearchListener<S> sl)
ISolversetSearchListener in interface ISolversl - a Search Listener.public int nextFreeVarId(boolean reserve)
ISolverISolver.realNumberOfVariables() method.nextFreeVarId in interface ISolverreserve - if true, the maxVarId is updated in the solver, i.e.
successive calls to nextFreeVarId(true) will return increasing
variable id while successive calls to nextFreeVarId(false)
will always answer the same.ISolver.realNumberOfVariables()public boolean removeSubsumedConstr(IConstr c)
ISolverremoveSubsumedConstr in interface ISolverc - a constraint returned by one of the add method. It must be the
latest constr added to the solver.public <S extends ISolverService> SearchListener<S> getSearchListener()
ISolvergetSearchListener in interface ISolverpublic boolean isVerbose()
ISolverpublic void setVerbose(boolean value)
ISolversetVerbose in interface ISolvervalue - true to allow the solver to output messages on the console,
false either.public void setLogPrefix(String prefix)
ISolversetLogPrefix in interface ISolverprefix - the prefix to be in front of each line of textpublic String getLogPrefix()
getLogPrefix in interface ISolverpublic IVecInt unsatExplanation()
ISolverunsatExplanation in interface ISolverIProblem.isSatisfiable(IVecInt),
IProblem.isSatisfiable(IVecInt, boolean)public int[] primeImplicant()
IProblemprimeImplicant in interface IProblempublic IConstr addExactly(IVecInt literals, int n) throws ContradictionException
ISolveraddExactly in interface ISolverliterals - a set of literals. The vector can be reused since the solver
is not supposed to keep a reference to that vector.n - the number of literals that must be satisfiedContradictionException - iff the constraint is trivially unsatisfiable.public int[] modelWithInternalVariables()
ISolvermodelWithInternalVariables in interface ISolverIProblem.model(),
ModelIteratorpublic int realNumberOfVariables()
ISolverISolver.nextFreeVarId(boolean) method.realNumberOfVariables in interface ISolverISolver.nextFreeVarId(boolean)public void registerLiteral(int p)
ISolverregisterLiteral in interface ISolverp - the literal in Dimacs format that should appear in the model.public boolean isSolverKeptHot()
ISolverisSolverKeptHot in interface ISolverpublic void setKeepSolverHot(boolean value)
ISolversetKeepSolverHot in interface ISolvervalue - true to keep the heuristics values across calls, false either.public boolean primeImplicant(int p)
IProblemIProblem.primeImplicant() method.primeImplicant in interface IProblemp - a literal in Dimacs formatIProblem.primeImplicant()public ISolver getSolvingEngine()
ISolvergetSolvingEngine in interface ISolverpublic void setUnitClauseProvider(UnitClauseProvider ucp)
ISolversetUnitClauseProvider in interface ISolverucp - an object able to provide unit clauses.Copyright © 2013 Centre de Recherche en Informatique de Lens (CRIL). All Rights Reserved.