| Package | Description |
|---|---|
| org.sat4j.pb |
Implementations of pseudo boolean solvers
|
| org.sat4j.pb.core |
Implementations of pseudo boolean solvers
|
| org.sat4j.pb.multiobjective | |
| org.sat4j.pb.reader |
Readers for opb instances.
|
| org.sat4j.pb.tools |
Implementation of different tools for pseudo boolean solvers
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
IGroupPBSolver |
interface |
IIntegerPBSolver
A PBSolver which implements this interface must be able to handle bounded
positive integer variables.
|
| Modifier and Type | Class and Description |
|---|---|
class |
ConstraintRelaxingPseudoOptDecorator |
class |
GroupPBSelectorSolver |
class |
LPStringSolver
Solver used to display in a string the pb-instance in OPB format.
|
class |
OPBStringSolver
Solver used to display in a string the pb-instance in OPB format.
|
class |
OptToPBSATAdapter
Utility class to use optimization solvers instead of simple SAT solvers in
code meant for SAT solvers.
|
class |
PBSolverDecorator
A decorator for the PB solvers.
|
class |
PBSolverHandle
A PBSolverHandle is a PBSolverDecorator in which it is possible to change the
decorated solver, in contrast with classical decorators.
|
class |
PBTimeoutIsolator
Solver Decorator to prevent the solver to receive a programmatic timeout
change.
|
class |
PseudoIteratorDecorator
A decorator that computes all pseudo boolean models.
|
class |
PseudoOptDecorator
A decorator that computes minimal pseudo boolean models.
|
class |
UserFriendlyPBStringSolver<T>
Solver to display SAT instances using domain objects names instead of Dimacs
numbers.
|
| Modifier and Type | Method and Description |
|---|---|
IPBSolver |
SolverFactory.lightSolver() |
static IPBSolver |
SolverFactory.newAllPOS2020() |
static IPBSolver |
SolverFactory.newAllPOS2020WL() |
static IPBSolver |
SolverFactory.newAllSAT2020() |
static IPBSolver |
SolverFactory.newBoth()
Resolution and CuttingPlanes based solvers running in parallel.
|
static IPBSolver |
SolverFactory.newBothPartialRoundingSatPOS2020() |
static IPBSolver |
SolverFactory.newBothPartialRoundingSatPOS2020WL() |
static IPBSolver |
SolverFactory.newBothPOS2020() |
static IPBSolver |
SolverFactory.newBothPOS2020WL() |
static IPBSolver |
SolverFactory.newBothRoundingSatPOS2020() |
static IPBSolver |
SolverFactory.newBothRoundingSatPOS2020WL() |
static IPBSolver |
SolverFactory.newBothStar()
Resolution and CuttingPlanesStar based solvers running in parallel.
|
static IPBSolver |
SolverFactory.newCuttingPlanesAggressiveCleanup()
Cutting Planes based solver.
|
static IPBSolver |
SolverFactory.newCuttingPlanesPOS2020() |
static IPBSolver |
SolverFactory.newCuttingPlanesPOS2020WL() |
static IPBSolver |
SolverFactory.newCuttingPlanesReduceByGCDSkip() |
static IPBSolver |
SolverFactory.newCuttingPlanesReduceByPowersOf2Skip()
Same cutting planes based solver, with jan Elffer's skip of cutting
planes activated
|
static IPBSolver |
SolverFactory.newCuttingPlanesStarCardLearningSkip() |
static IPBSolver |
SolverFactory.newCuttingPlanesStarClauseLearningSkip() |
static IPBSolver |
SolverFactory.newCuttingPlanesStarDivideBy2Skip() |
static IPBSolver |
SolverFactory.newCuttingPlanesStarDivideByGCDSkip() |
static IPBSolver |
SolverFactory.newCuttingPlanesStarReduceToCardSkip() |
static IPBSolver |
SolverFactory.newCuttingPlanesStarRoundingSkip() |
static IPBSolver |
SolverFactory.newCuttingPlanesStarSkip() |
static IPBSolver |
SolverFactory.newCuttingPlanesWatched() |
static IPBSolver |
SolverFactory.newDefaultNonNormalized()
Default solver of the SolverFactory for instances not normalized.
|
static IPBSolver |
SolverFactory.newDefaultOptimizer()
Provides the best available PB solver of the library ready to solve
optimization problems.
|
static IPBSolver |
SolverFactory.newEclipseP2() |
static IPBSolver |
SolverFactory.newInprocDetectCards() |
static IPBSolver |
SolverFactory.newInprocDetectCardsSkip() |
static IPBSolver |
SolverFactory.newLazyInprocDetectCards() |
static IPBSolver |
SolverFactory.newLazyInprocDetectCardsSkip() |
static IPBSolver |
SolverFactory.newLight()
Small footprint SAT solver.
|
static IPBSolver |
SolverFactory.newOPBStringSolver() |
static IPBSolver |
SolverFactory.newPartialRoundingSat() |
static IPBSolver |
SolverFactory.newPartialRoundingSatPOS2020() |
static IPBSolver |
SolverFactory.newPartialRoundingSatPOS2020WL() |
static IPBSolver |
SolverFactory.newResolution()
Resolution based solver (i.e. classic SAT solver able to handle generic
constraints.
|
static IPBSolver |
SolverFactory.newResolutionMaxMemory()
Resolution based solver (i.e. classic SAT solver able to handle generic
constraints.
|
static IPBSolver |
SolverFactory.newResolutionSimpleRestarts()
Resolution based solver (i.e. classic SAT solver able to handle generic
constraints.
|
static IPBSolver |
SolverFactory.newResolutionWL()
Resolution based solver (i.e. classic SAT solver able to handle generic
constraints.
|
static IPBSolver |
SolverFactory.newRoundingSat() |
static IPBSolver |
SolverFactory.newRoundingSatPOS2020() |
static IPBSolver |
SolverFactory.newRoundingSatPOS2020WL() |
static IPBSolver |
SolverFactory.newSATUNSAT()
Two solvers are running in //: one for solving SAT instances, the other
one for solving unsat instances.
|
static IPBSolver |
SolverFactory.newSimpleSimplification()
Resolution based solver (i.e. classic SAT solver able to handle generic
constraints.
|
static IPBSolver |
SolverFactory.newSoberBoth()
Resolution and CuttingPlanes based solvers running in parallel.
|
| Modifier and Type | Method and Description |
|---|---|
static PreprocCardConstrLearningSolver<IPBSolver> |
SolverFactory.newDetectCards() |
static PreprocCardConstrLearningSolver<IPBSolver> |
SolverFactory.newDetectCardsAndExit() |
| Modifier and Type | Method and Description |
|---|---|
void |
PBSolverHandle.changeDecorated(IPBSolver solver) |
| Constructor and Description |
|---|
ConstraintRelaxingPseudoOptDecorator(IPBSolver solver) |
GroupPBSelectorSolver(IPBSolver solver) |
PBSolverDecorator(IPBSolver solver) |
PBSolverHandle(IPBSolver solver) |
PBTimeoutIsolator(IPBSolver solver) |
PseudoIteratorDecorator(IPBSolver solver) |
PseudoOptDecorator(IPBSolver solver)
Create a PB decorator for which a non optimal solution means that the
problem is satisfiable.
|
PseudoOptDecorator(IPBSolver solver,
boolean nonOptimalMeansSatisfiable)
Create a PB decorator with a specific semantic of non optimal solution.
|
PseudoOptDecorator(IPBSolver solver,
boolean nonOptimalMeansSatisfiable,
boolean useAnImplicantForEvaluation)
Create a PB decorator with a specific semantic of non optimal solution.
|
| Constructor and Description |
|---|
LanceurPseudo2007(ASolverFactory<IPBSolver> factory) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
IPBCDCLSolver<D extends PBDataStructureFactory>
Abstraction for Conflict Driven Clause Learning PBSolver.
|
| Modifier and Type | Class and Description |
|---|---|
class |
IntegerPBSolverDecorator
A PBSolver decorator which allow a PBSolver to handle integer variables.
|
class |
ObjectiveReducerPBSolverDecorator |
class |
PBSolver |
class |
PBSolverCautious |
class |
PBSolverClause |
class |
PBSolverCP |
class |
PBSolverCPCardLearning |
class |
PBSolverCPClauseLearning |
class |
PBSolverCPLong |
class |
PBSolverCPLongDivideBy2 |
class |
PBSolverCPLongDivideByGCD |
class |
PBSolverCPLongReduceToCard |
class |
PBSolverCPLongRounding |
class |
PBSolverCPReduceByGCD |
class |
PBSolverCPReduceByPowersOf2 |
class |
PBSolverResCP |
class |
PBSolverResolution |
class |
PBSolverWithImpliedClause |
| Constructor and Description |
|---|
IntegerPBSolverDecorator(IPBSolver solver) |
ObjectiveReducerPBSolverDecorator(IPBSolver decorated) |
| Modifier and Type | Class and Description |
|---|---|
class |
CriterionOptimumComputer<S extends IPBSolver>
A class used to compute optimal values for each criteria for a given problem.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractLinMultiObjOptimizer
A partial implementation of the IMUltiObjectivePBSolver interface designed to
handle optimization functions which are a linear aggregation of other
objective functions.
|
class |
LeximinDecorator |
class |
MinSumOWAOptimizer
An optimizer intended to solve an increasing weights OWA based problem.
|
class |
OrderedObjsOWAOptimizer
An optimizer intended to solve an OWA based problem.
|
class |
SumLeximinDecompositionOWAOptimizer |
| Modifier and Type | Field and Description |
|---|---|
protected IPBSolver |
OPBReader2005.solver |
| Constructor and Description |
|---|
JSONPBReader(IPBSolver solver) |
OPBEclipseReader2007(IPBSolver solver) |
OPBReader2005(IPBSolver solver) |
OPBReader2006(IPBSolver solver) |
OPBReader2007(IPBSolver solver) |
OPBReader2010(IPBSolver solver) |
PBInstanceReader(IPBSolver solver) |
| Modifier and Type | Class and Description |
|---|---|
class |
ManyCorePB<S extends IPBSolver> |
class |
PreprocCardConstrLearningSolver<S extends IPBSolver> |
| Modifier and Type | Class and Description |
|---|---|
class |
ClausalConstraintsDecorator |
class |
InprocCardConstrLearningSolver |
class |
LexicoDecoratorPB |
class |
ManyCoreIntegerPB<S extends IIntegerPBSolver> |
class |
ManyCorePB<S extends IPBSolver> |
class |
OptimalModelIterator |
class |
PBAdapter
Allow to put a ISolver when an IPBSolver is required.
|
class |
PreprocCardConstrLearningSolver<S extends IPBSolver> |
class |
SteppedTimeoutLexicoDecoratorPB |
class |
XplainPB |
| Modifier and Type | Method and Description |
|---|---|
IPBSolver |
DependencyHelper.getSolver() |
| Modifier and Type | Method and Description |
|---|---|
List<IPBSolver> |
PreprocCardConstrLearningSolver.getSolvers() |
| Constructor and Description |
|---|
CardConstrFinder(IPBSolver coSolver) |
ClausalConstraintsDecorator(IPBSolver solver) |
ClausalConstraintsDecorator(IPBSolver solver,
EncodingStrategyAdapter encodingAd) |
DependencyHelper(IPBSolver solver) |
DependencyHelper(IPBSolver solver,
boolean explanationEnabled) |
DependencyHelper(IPBSolver solver,
boolean explanationEnabled,
boolean canonicalOptFunctionEnabled) |
LexicoDecoratorPB(IPBSolver solver) |
LexicoHelper(IPBSolver solver) |
LexicoHelper(IPBSolver solver,
boolean explanationEnabled) |
LexicoHelper(IPBSolver solver,
boolean explanationEnabled,
boolean canonicalOptFunctionEnabled) |
ManyCorePB(S... iSolver) |
OptimalModelIterator(IPBSolver solver)
Create an iterator over the solutions available in
solver. |
OptimalModelIterator(IPBSolver solver,
long bound)
Create an iterator over a limited number of solutions available in
solver. |
PreprocCardConstrLearningSolver(IPBSolver solverToFill) |
PreprocCardConstrLearningSolver(IPBSolver solverToFill,
boolean outputCardsAndExit) |
SteppedTimeoutLexicoDecoratorPB(IPBSolver solver) |
SteppedTimeoutLexicoHelper(IPBSolver solver) |
SteppedTimeoutLexicoHelper(IPBSolver solver,
boolean explanationEnabled) |
SteppedTimeoutLexicoHelper(IPBSolver solver,
boolean explanationEnabled,
boolean canonicalOptFunctionEnabled) |
XplainPB(IPBSolver solver) |
| Constructor and Description |
|---|
PreprocCardConstrLearningSolver(ASolverFactory<IPBSolver> factory,
String solverName) |
Copyright © 2020 Centre de Recherche en Informatique de Lens (CRIL). All rights reserved.