- All Implemented Interfaces:
- java.io.Serializable
public class Binary
extends EncodingStrategyAdapter
Binary encoding for the "at most one" and "at most k" cases.
For the case "at most one", we can use the binary encoding (also called
birwise encoding) first described in A. M. Frisch, T. J. Peugniez, A. J.
Dogget and P. Nightingale, "Solving Non-Boolean Satisfiability Problems With
Stochastic Local Search: A Comparison of Encodings" in Journal of Automated
Reasoning, vol. 35, n 1-3, 2005.
The approach is generalized for the "at most k" case in A. M. Frisch and P.
A. Giannaros, "SAT Encodings of the At-Most-k Constraint", in International
Workshop on Modelling and Reformulating Constraint Satisfaction Problems,
2010
- Since:
- 2.3.1
- Author:
- sroussel
- See Also:
- Serialized Form