Year: 2020
Type: preprint
Abstract: This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with respect to their deductive power regarding General Arc Consistency (GAC).
Source: arXiv (Cornell University)
Authors: Bailleux, Olivier, Boufkhad, Yacine
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3034052886