Towards an optimal CNF encoding of boolean cardinality constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 827-831

  Sinz, Carsten ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; CONSTRAINT THEORY; ENCODING (SYMBOLS); LINEAR SYSTEMS;

AUXILIARY VARIABLES; BOOLEAN CARDINALITY; CONJUNCTIVE NORMAL FORM (CNF);

BOOLEAN ALGEBRA;

EID: 33646181818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_73     Document Type: Conference Paper

References (8)

1. Küchlin, W., Sinz, C.: Proving consistency assertions for automotive product data management. J. Automated Reasoning 24 (2000) 145-163
2. Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignment. Constraints 4 (1999) 79-89
3. Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In Rossi, F., ed.: 9th Intl, Conf, on Principles and Practice of Constraint Programming (CP 2003). Volume 2833 of Lecture Notes in Computer Science., Springer (2003) 108-122
4. Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett. 68 (1998) 63-69
5. Tseitin, G.S.; On the complexity of derivation in propositional calculus. In Slisenko, A.O., ed.: Studies in Constructive Mathematics and Mathematical Logic. (1970) 115-125
6. Jackson, P., Sheridan, D.: The optimality of a fast CNF conversion and its use with SAT. Technical Report APES-82-2004, APES Research Group (2004) Available from http://www.dcs.st-and.ac.uk/apes/apesreports.html.
7. Muller, D.E., Preparata, F.P.: Bounds to complexities of networks for sorting and for switching. J. ACM 22 (1975) 195-201
8. Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner (1987)