2010/12/17 by Olivier Bailleux, Bailleux, Olivier
Computer Science · #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.1012.3853
arxiv created 2010/12/17 · openalex publication_date 2010/12/17 · arxiv updated 2010/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this report, we propose a quick survey of the currently known techniques for encoding a Boolean cardinality constraint into a CNF formula, and we discuss about the relevance of these encodings. We also propose models to facilitate analysis and design of CNF encodings for Boolean constraints.