A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains

This paper compares the efficiency of a number of Constraint Logic Programming (CLP) systems in the setting of finite domains as well as a specific aspect of their expressiveness (that concerning reification and meta-constraints). There are two key reasons for adopting CLP technology for solving a p...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Constraints : an international journal Ročník 5; číslo 3; s. 275 - 301
Hlavní autori: Fernández, Antonio J., Hill, Patricia M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Heidelberg Springer 2000
Predmet:
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Language theory and syntactical analysis
Programming theory
Theoretical computing
Labelling
Constraint logic programming
Programming language
Boolean logic
Propagator
ISSN:1383-7133, 1572-9354
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper compares the efficiency of a number of Constraint Logic Programming (CLP) systems in the setting of finite domains as well as a specific aspect of their expressiveness (that concerning reification and meta-constraints). There are two key reasons for adopting CLP technology for solving a problem. The first is its expressiveness enabling a declarative solution with readable code which is vital for maintenance and the second is the provision of an efficient implementation for the computationally expensive procedures. However, CLP systems differ significantly both in how solutions may be expressed and the efficiency of their execution and it is important that both these factors are taken into account when choosing the best CLP system for a particular application. This paper aids this choice by illustrating differences between the systems, indicating their particular strengths and weaknesses.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1383-7133
1572-9354
DOI:10.1023/A:1009816801567