Detecting Cardinality Constraints in CNF
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 285-301
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Representative Encodings to Translate Finite CSPs into SAT2014
- Perfect Hashing and CNF Encodings of Cardinality Constraints2012
- Cardinality Networks and Their Applications2009
- Exploiting multivalued knowledge in variable selection heuristics for SAT solversAnnals of Mathematics and Artificial Intelligence, 2007
- Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions2007
- Mapping Problems with Finite-Domain Variables to Problems with Boolean VariablesLecture Notes in Computer Science, 2005
- Efficient CNF Encoding of Boolean Cardinality Constraints2003
- Generic ILP versus specialized 0-1 ILP2006 IEEE/ACM International Conference on Computer Aided Design, 2002
- Linear 0–1 inequalities and extended clausesLecture Notes in Computer Science, 1993
- On the complexity of cutting-plane proofsDiscrete Applied Mathematics, 1987