Advertisement

Pairwise Cardinality Networks

  • Michael Codish
  • Moshe Zazon-Ivry
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6355)

Abstract

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.

Keywords

Unit Propagation Partial Evaluation Propositional Formula Cardinality Constraint Satisfying Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Cardinality networks and their applications. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 167–180. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference. AFIPS Conference Proceedings, vol. 32, pp. 307–314. Thomson Book Company, Washington (1968)Google Scholar
  3. 3.
    Codish, M., Lagoon, V., Stuckey, P.J.: Logic programming with satisfiability. Theory and Practice of Logic Programming 8(1), 121–128 (2008)CrossRefzbMATHGoogle Scholar
  4. 4.
    Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into sat. JSAT 2(1-4), 1–26 (2006)zbMATHGoogle Scholar
  5. 5.
    Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)zbMATHGoogle Scholar
  6. 6.
    Parberry, I.: Parallel Complexity Theory. Research Notes in Theoretical Computer Science. Pitman Publishing, London (1987)zbMATHGoogle Scholar
  7. 7.
    Parberry, I.: The pairwise sorting network. Parallel Processing Letters 2, 205–211 (1992)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Wah, B.W., Chen, K.-L.: A partitioning approach to the design of selection networks. IEEE Trans. Computers 33(3), 261–268 (1984)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Michael Codish
    • 1
  • Moshe Zazon-Ivry
    • 1
  1. 1.Department of Computer ScienceBen-Gurion UniversityIsrael

Personalised recommendations