Implementing global constraints as graphs of elementary constraints

Hanák Dávid: Implementing global constraints as graphs of elementary constraints. In: Acta cybernetica, (16) 2. pp. 241-258. (2003)

[thumbnail of cybernetica_016_numb_002_241-258.pdf]
Cikk, tanulmány, mű

Download (871kB) | Preview


Global constraints are cardinal concepts of CLP (FD), a constraint programming language. They are means to find a set of integers that satisfy certain relations. The fact that defining global constraints often requires the knowledge of a specification language makes sharing constraints between scientists and programmers difficult. Nicolas Beldiceanu presented a theory that could solve this problem, because it depicts global constraints as graphs: an abstraction that everyone understands. The abstract description language defined by the theory may also be interpreted by a computer program. This paper deals with the problematic issues of putting the theory into practice by implementing such a program. It introduces a concrete syntax of the language and presents three programs understanding that syntax. These case studies represent two different approaches of propagation. One of these offers exhausting pruning with poor efficiency, the other, yet unfinished attempt provides a better alternative at the cost of being a lot more complicated.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2003
Volume: 16
Number: 2
ISSN: 0324-721X
Page Range: pp. 241-258
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (3.) (2002) (Szeged)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 258. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 15:29

Actions (login required)

View Item View Item