Uses of Class
org.sat4j.pb.constraints.pb.ConflictMap

Packages that use ConflictMap

Package	Description
org.sat4j.pb.constraints.pb	Implementations of pseudo boolean constraints.

Uses of ConflictMap in org.sat4j.pb.constraints.pb

Subclasses of ConflictMap in org.sat4j.pb.constraints.pb

Modifier and Type	Class and Description
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

Methods in org.sat4j.pb.constraints.pb with parameters of type ConflictMap

Modifier and Type	Method and Description
int	PostProcessToClause.chooseAssertiveLiteral(int maxLevel, ConflictMap conflictMap)
void	NoPostProcess.postProcess(int dl, ConflictMap conflictMap)
void	PostProcessDivideByGCD.postProcess(int dl, ConflictMap conflictMap)
void	PostProcessToCard.postProcess(int dl, ConflictMap conflictMap)
void	IPostProcess.postProcess(int dl, ConflictMap conflictMap)
void	PostProcessDivideBy2.postProcess(int dl, ConflictMap conflictMap)
void	PostProcessToClause.postProcess(int dl, ConflictMap conflictMap)
void	NoPreProcess.preProcess(int dl, ConflictMap conflictMap)
void	IPreProcess.preProcess(int dl, ConflictMap conflictMap)
void	PreProcessReduceConflict.preProcess(int dl, ConflictMap conflictMap)
abstract boolean	SkipStrategy.skip(ConflictMap map, int litImplied)