|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use EncodingStrategyAdapter | |
---|---|
org.sat4j.tools | Tools to be used on top of an ISolver. |
org.sat4j.tools.encoding |
Uses of EncodingStrategyAdapter in org.sat4j.tools |
---|
Constructors in org.sat4j.tools with parameters of type EncodingStrategyAdapter | |
---|---|
ClausalCardinalitiesDecorator(T solver,
EncodingStrategyAdapter encodingAd)
|
Uses of EncodingStrategyAdapter in org.sat4j.tools.encoding |
---|
Subclasses of EncodingStrategyAdapter in org.sat4j.tools.encoding | |
---|---|
class |
Binary
For the case "at most one", we can use the binary encoding (also called birwise encoding) first described in A. |
class |
Binomial
For the "at most one" case, this encoding is equivalent to the one referred to in the literature as the pair-wise or naive encoding. |
class |
Commander
The case "at most one" is introduced in W. |
class |
Ladder
For the cases "at most one" and "exactly one", we can use the ladder encoding described in: I. |
class |
Policy
This class allows the use of different encodings for different cardinality constraints. |
class |
Product
The encoding for "at most one" constraints was introduced by J. |
class |
Sequential
For the cases "at most k", we can use the sequential encoding described in: C. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |