Package | Description |
---|---|
org.sat4j.pb.constraints |
Implementation of data structures for pseudo boolean constraints.
|
org.sat4j.pb.constraints.pb |
Implementations of pseudo boolean constraints.
|
Modifier and Type | Method and Description |
---|---|
protected PBConstr |
PuebloPBMinDataStructure.constraintFactory(int[] literals,
BigInteger[] coefs,
BigInteger degree) |
protected PBConstr |
PBMinDataStructure.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 |
ConflictMap.createConflict(PBConstr cpb,
int level)
constructs the data structure needed to perform cutting planes
|
static IConflict |
ConflictMapSwitchToClause.createConflict(PBConstr cpb,
int level) |
static IConflict |
ConflictMapClause.createConflict(PBConstr cpb,
int level) |
BigInteger |
MapPb.cuttingPlane(PBConstr cpb,
BigInteger degreeCons,
BigInteger[] reducedCoefs,
BigInteger coefMult,
VarActivityListener val) |
BigInteger |
IDataStructurePB.cuttingPlane(PBConstr cpb,
BigInteger degreeCons,
BigInteger[] reducedCoefs,
BigInteger coefMult,
VarActivityListener val) |
BigInteger |
MapPb.cuttingPlane(PBConstr cpb,
BigInteger deg,
BigInteger[] reducedCoefs,
VarActivityListener val) |
BigInteger |
IDataStructurePB.cuttingPlane(PBConstr cpb,
BigInteger deg,
BigInteger[] reducedCoefs,
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 |
---|
ConflictMapCardinality(PBConstr cpb,
int level) |
ConflictMapClause(PBConstr cpb,
int level) |
ConflictMapSwitchToClause(PBConstr cpb,
int level) |
Copyright © 2013 Centre de Recherche en Informatique de Lens (CRIL). All Rights Reserved.