Skip to content

Add more encodings for cardinality constraints #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Lipen opened this issue Nov 20, 2021 · 0 comments
Open

Add more encodings for cardinality constraints #3

Lipen opened this issue Nov 20, 2021 · 0 comments

Comments

@Lipen
Copy link
Owner

Lipen commented Nov 20, 2021

As the title says, we need to provide more encodings for cardinality constraints (of the form k_min <= \sum(lit) <= k_max). Currently, only Totalizer [1] encoding is implemented, but are many others (e.g., sorting networks), which might be even more efficient (at least, for some problems).
[1] O. Bailleux and Y. Boufkhad, “Efficient CNF encoding of Boolean cardinality constraints,” in Principles and Practice of Constraint Programming, 2003, pp. 108–122. doi: 10.1007/978-3-540-45193-8_8.

The starting points for research:

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant