| Package | Description |
|---|---|
| org.sat4j.pb.constraints |
Implementation of data structures for pseudo boolean constraints.
|
| org.sat4j.pb.constraints.pb |
Implementations of pseudo boolean constraints.
|
| org.sat4j.pb.core |
Implementations of pseudo boolean solvers
|
| org.sat4j.pb.lcds | |
| org.sat4j.pb.orders |
Various heuristics for the next variable to branch on.
|
| Modifier and Type | Method and Description |
|---|---|
protected PBConstr |
PBMinDataStructure.constraintFactory(int[] literals,
BigInteger[] coefs,
BigInteger degree) |
protected PBConstr |
PuebloPBMinDataStructure.constraintFactory(int[] literals,
BigInteger[] coefs,
BigInteger degree) |
protected PBConstr |
PuebloPBMinDataStructure.learntConstraintFactory(IDataStructurePB dspb) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
IWatchPb |
| Modifier and Type | Class and Description |
|---|---|
class |
AtLeastPB |
class |
LearntBinaryClausePB |
class |
LearntHTClausePB |
class |
MaxWatchPb
Data structure for pseudo-boolean constraint with watched literals.
|
class |
MaxWatchPbLongCP
Data structure for pseudo-boolean constraint with watched literals.
|
class |
MinWatchCardPB |
class |
MinWatchPb
Data structure for pseudo-boolean constraint with watched literals.
|
class |
MinWatchPbLongCP
Data structure for pseudo-boolean constraint with watched literals.
|
class |
OriginalBinaryClausePB |
class |
OriginalHTClausePB |
class |
PuebloMinWatchPb |
class |
UnitClausePB |
class |
UnitClausesPB |
class |
WatchPb
Abstract data structure for pseudo-boolean constraint with watched literals.
|
class |
WatchPbLongCP |
| Modifier and Type | Method and Description |
|---|---|
static PBConstr |
AtLeastPB.atLeastNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
int n) |
static PBConstr |
MinWatchCardPB.minWatchCardPBNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
boolean moreThan,
int degree)
Permet la cr?
|
static PBConstr |
MinWatchCardPB.normalizedMinWatchCardPBNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
int degree)
Permet la cr?
|
| Modifier and Type | Method and Description |
|---|---|
static IConflict |
ConflictMapClause.createConflict(PBConstr cpb,
int level) |
static IConflict |
ConflictMapClause.createConflict(PBConstr cpb,
int level,
boolean noRemove) |
static IConflict |
ConflictMapWeakenToClash.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMapMinimizeWeakening.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMapRounding.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMapReduceToClause.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postprocess,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMapReduceToCard.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postprocess,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
IConflict |
IConflictFactory.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postprocess,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMap.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preProcessing,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats)
constructs the data structure needed to perform cutting planes
|
static IConflict |
ConflictMapWeakenReason.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMapReduceByGCD.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postprocess,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMapReduceByPowersOf2.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postprocess,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
static IConflict |
ConflictMapDivideByPivot.createConflict(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats,
DivisionStrategy divisionStrategy,
IReduceConflictStrategy reduceConflict,
boolean divideReason) |
BigInteger |
IDataStructurePB.cuttingPlane(PBConstr cpb,
BigInteger degreeCons,
BigInteger[] reducedCoefs,
BigInteger coefMult,
VarActivityListener val,
int p) |
BigInteger |
MapPb.cuttingPlane(PBConstr cpb,
BigInteger degreeCons,
BigInteger[] reducedCoefs,
BigInteger coefMult,
VarActivityListener val,
int p) |
BigInteger |
IDataStructurePB.cuttingPlane(PBConstr cpb,
BigInteger deg,
BigInteger[] reducedCoefs,
VarActivityListener val,
int p) |
BigInteger |
MapPb.cuttingPlane(PBConstr cpb,
BigInteger deg,
BigInteger[] reducedCoefs,
VarActivityListener val,
int p) |
BigInteger |
ConflictMapMinimizeWeakening.resolve(PBConstr cpb,
int litImplied,
VarActivityListener val) |
BigInteger |
ConflictMap.resolve(PBConstr cpb,
int litImplied,
VarActivityListener val)
computes a cutting plane with a pseudo-boolean constraint. this method
updates the current instance (of ConflictMap).
|
BigInteger |
IConflict.resolve(PBConstr cpb,
int litImplied,
VarActivityListener val)
Effectue une resolution avec une contrainte PB.
|
| Constructor and Description |
|---|
ConflictMapClause(PBConstr cpb,
int level) |
ConflictMapClause(PBConstr cpb,
int level,
boolean noRemove) |
ConflictMapDivideByPivot(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats,
DivisionStrategy divisionStrategy,
IReduceConflictStrategy reduceConflict,
boolean divideReason) |
ConflictMapMinimizeWeakening(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
ConflictMapReduceByGCD(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
ConflictMapReduceByPowersOf2(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IWeakeningStrategy weakeningStrategy,
IPreProcess preprocess,
IPostProcess postProcessing,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
ConflictMapReduceToCard(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postprocess,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
ConflictMapReduceToClause(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postprocess,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
ConflictMapRounding(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
ConflictMapSwitchToClause(PBConstr cpb,
int level) |
ConflictMapSwitchToClause(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
PBSolverStats stats) |
ConflictMapWeakenReason(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
ConflictMapWeakenToClash(PBConstr cpb,
int level,
boolean noRemove,
SkipStrategy skip,
IPreProcess preprocess,
IPostProcess postProcessing,
IWeakeningStrategy weakeningStrategy,
AutoDivisionStrategy autoDivisionStrategy,
PBSolverStats stats) |
| Modifier and Type | Method and Description |
|---|---|
protected IConflict |
PBSolverCautious.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPLong.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPLongDivideBy2.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPLongReduceToCard.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPLongRounding.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPClauseLearning.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPReduceByPowersOf2.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverClause.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPLongDivideByGCD.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPCardLearning.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCPReduceByGCD.chooseConflict(PBConstr myconfl,
int level) |
protected IConflict |
PBSolverCP.chooseConflict(PBConstr myconfl,
int level) |
| Modifier and Type | Method and Description |
|---|---|
protected int |
UnassignedLiteralsHaveSameLevelLBDComputerStrategy.assignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
IgnoreUnassignedLiteralsLBDComputerStrategy.assignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
EffectiveLiteralsOnlyLBDComputerStrategy.assignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
FalsifiedLiteralsOnlyLBDComputerStrategy.assignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected abstract int |
AbstractLBDComputerStrategy.assignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
UnassignedLiteralsHaveDifferentLevelLBDComputerStrategy.assignedLiteral(ILits voc,
PBConstr constr,
int i) |
int |
RatioCoefficientsDegreeLBDComputerStrategy.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
int |
ILBDComputerStrategy.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
int |
LBDComputerStrategyDecorator.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
int |
WeightedLBDComputerStrategy.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
int |
SlackLBDComputerStrategy.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
int |
DegreeSizeLBDComputerStrategy.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
int |
AbstractLBDComputerStrategy.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
int |
DegreeLBDComputerStrategy.computeLBD(ILits voc,
PBConstr constr,
int propagated) |
protected int |
EffectiveLiteralsOnlyLBDComputerStrategy.fixLbd(PBConstr constr,
int lbd) |
protected int |
AbstractLBDComputerStrategy.fixLbd(PBConstr constr,
int lbd) |
protected void |
UnassignedLiteralsHaveSameLevelLBDComputerStrategy.startComputeLBD(PBConstr constr,
int propagated) |
protected void |
EffectiveLiteralsOnlyLBDComputerStrategy.startComputeLBD(PBConstr constr,
int propagated) |
protected void |
AbstractLBDComputerStrategy.startComputeLBD(PBConstr constr,
int propagated) |
protected int |
UnassignedLiteralsHaveSameLevelLBDComputerStrategy.unassignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
IgnoreUnassignedLiteralsLBDComputerStrategy.unassignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
EffectiveLiteralsOnlyLBDComputerStrategy.unassignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
FalsifiedLiteralsOnlyLBDComputerStrategy.unassignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected abstract int |
AbstractLBDComputerStrategy.unassignedLiteral(ILits voc,
PBConstr constr,
int i) |
protected int |
UnassignedLiteralsHaveDifferentLevelLBDComputerStrategy.unassignedLiteral(ILits voc,
PBConstr constr,
int i) |
| Modifier and Type | Method and Description |
|---|---|
void |
BumperEffective.postBumpActivity(IOrder order,
PBConstr constr) |
void |
DoubleBumpClashingLiteralsDecorator.postBumpActivity(IOrder order,
PBConstr constr) |
void |
IBumper.postBumpActivity(IOrder order,
PBConstr constr) |
void |
Bumper.postBumpActivity(IOrder order,
PBConstr constr) |
void |
BumperEffectiveAndPropagated.postBumpActivity(IOrder order,
PBConstr constr) |
void |
BumperEffective.varBumpActivity(ILits voc,
BumpStrategy bStrategy,
IOrder order,
PBConstr constr,
int lit,
int propagated) |
void |
DoubleBumpClashingLiteralsDecorator.varBumpActivity(ILits voc,
BumpStrategy bumpStrategy,
IOrder order,
PBConstr constr,
int i,
int propagated) |
void |
IBumper.varBumpActivity(ILits voc,
BumpStrategy bumpStrategy,
IOrder order,
PBConstr constr,
int i,
int propagated) |
void |
Bumper.varBumpActivity(ILits voc,
BumpStrategy bumpStrategy,
IOrder order,
PBConstr constr,
int i,
int propagated) |
void |
BumperEffectiveAndPropagated.varBumpActivity(ILits voc,
BumpStrategy bStrategy,
IOrder order,
PBConstr constr,
int lit,
int propagated) |
abstract void |
BumpStrategy.varBumpActivity(IOrder order,
PBConstr constr,
int i) |
Copyright © 2020 Centre de Recherche en Informatique de Lens (CRIL). All rights reserved.