Pairwise cardinality networks

Michael Codish, Moshe Zazon-Ivry

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

36 Scopus citations

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.

Original languageEnglish
Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Revised Selected Papers
Pages154-172
Number of pages19
DOIs
StatePublished - 1 Dec 2010
Event16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-16 - Dakar, Senegal
Duration: 25 Apr 20101 May 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6355 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-16
Country/TerritorySenegal
CityDakar
Period25/04/101/05/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Pairwise cardinality networks'. Together they form a unique fingerprint.

Cite this