| Package | Description |
|---|---|
| org.sat4j.pb.constraints.pb |
Implementations of pseudo boolean constraints.
|
| org.sat4j.pb.core |
Implementations of pseudo boolean solvers
|
| Modifier and Type | Class and Description |
|---|---|
class |
ConflictMap |
class |
ConflictMapClause |
class |
ConflictMapDivideByPivot |
class |
ConflictMapMinimizeWeakening |
class |
ConflictMapReduceByGCD |
class |
ConflictMapReduceByPowersOf2 |
class |
ConflictMapReduceToCard
This class implements the reduction to cardinality algorithm proposed by
Heidi Dixon in her dissertation.
|
class |
ConflictMapReduceToClause |
class |
ConflictMapRounding |
class |
ConflictMapSwitchToClause |
class |
ConflictMapWeakenReason |
class |
ConflictMapWeakenToClash |
| 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) |
| 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 void |
PBSolverCautious.updateNumberOfReducedLearnedConstraints(IConflict confl) |
protected void |
PBSolverCP.updateNumberOfReducedLearnedConstraints(IConflict confl) |
protected void |
PBSolverCautious.updateNumberOfReductions(IConflict confl) |
protected void |
PBSolverCP.updateNumberOfReductions(IConflict confl) |
Copyright © 2020 Centre de Recherche en Informatique de Lens (CRIL). All rights reserved.