Parallel complexity theory
A Partitioning Approach to the Design of Selection Networks
IEEE Transactions on Computers
Logic programming with satisfiability
Theory and Practice of Logic Programming
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Cardinality Networks and Their Applications
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Parallel search for maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Compiling finite domain constraints to sat with bee*
Theory and Practice of Logic Programming
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
We introduce pairwise cardinality networks, networks of comparators, derived from pairwise sorting networks, which express cardinality constraints. We show that pairwise cardinality networks are superior to the cardinality networks introduced in previous work which are derived from odd-even sorting networks. Our presentation identifies the precise relationship between odd-even and pairwise sorting networks. This relationship also clarifies why pairwise sorting networks have significantly better propagation properties for the application of cardinality constraints.