DMCA
A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains (2000)
Cached
Download Links
- [www.lcc.uma.es]
- [www.lcc.uma.es]
- [www.cs.unm.edu]
- [www.lcc.uma.es]
- [agora.leeds.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | Constraints |
| Citations: | 31 - 5 self |
BibTeX
@ARTICLE{Fernandez00acomparative,
author = {Antonio J. Fernandez and Particia M. Hill},
title = {A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains},
journal = {Constraints},
year = {2000},
volume = {5},
pages = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
