Revisiting the Cardinality operator and introducing the Cardinality-path constraint family

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

Volumn 2237, Issue , 2001, Pages 59-73

  Beldiceanu, Nicolas ^a   Carlsson, Mats ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

CARDINALITIES; META PROGRAMMING; PATH CONSTRAINT; PLANNING PROBLEM; PROPAGATION ALGORITHM; PROPAGATION RULE; SICSTUS PROLOG;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84937201543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_12     Document Type: Conference Paper

References (5)

1. Beldiceanu, N.: Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type. SICS Technical Report T2000/01, (2000).
2. Dincbas, M., Simonis, H., Van Hentenryck, P.: Solving the Car-Sequencing Problem in Constraint Logic Programming. ECAI 1988, 290-295, (1988).
3. Van Hentenryck, P., Deville, Y.: The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. ICLP 1991, 745-759, (1991).
4. Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, Implementation and Evaluation of the Constraint Language cc(FD). In A. Podelski, ed., Constraints: Basics and Trends, vol. 910 of Lecture Notes in Computer Science, Springer-Verlag, (1995).
5. Würtz, J., Müller, T.: Constructive Disjunction Revisited. In 20th German Annual Conf. On AI, LNAI 1137, 377-386, eds. G. Görz and S. Hölldobler, Springer-Verlag, (1996).