Revisiting the Cardinality Operator and Introducing the Cardinality-PathConstraint Family

  • Nicolas Beldiceanu
  • Mats Carlsson
Conference paper

DOI: 10.1007/3-540-45635-X_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2237)
Cite this paper as:
Beldiceanu N., Carlsson M. (2001) Revisiting the Cardinality Operator and Introducing the Cardinality-PathConstraint Family. In: Codognet P. (eds) Logic Programming. ICLP 2001. Lecture Notes in Computer Science, vol 2237. Springer, Berlin, Heidelberg

Abstract

This paper revisits the classical cardinality operator introducing new propagation rules that operate on variables that occur in more than one constraint. It also introduces a restricted case of the cardinality operator which is characterized by a structure of sliding constraints on consecutive variables. We call it cardinality-path and take advantage of these restrictions in order to come up with more efficient propagation algorithms. From an application point of view the cardinality-path constraint allows to express a host of regulation constraints occurring in personnel planning problems. We have used the metaprogramming services of Prolog in order to implement the cardinality-path constraint within SICStus Prolog.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Nicolas Beldiceanu
    • 1
  • Mats Carlsson
    • 1
  1. 1.SICSUppsalaSweden

Personalised recommendations