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...

Full description

Saved in:
Bibliographic Details
Published in:Constraints : an international journal Vol. 5; no. 3; pp. 275 - 301
Main Authors: Fernández, Antonio J., Hill, Patricia M.
Format: Journal Article
Language:English
Published: Heidelberg Springer 2000
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Fernández, Antonio J.
Hill, Patricia M.
Author_xml – sequence: 1
  givenname: Antonio J.
  surname: Fernández
  fullname: Fernández, Antonio J.
– sequence: 2
  givenname: Patricia M.
  surname: Hill
  fullname: Hill, Patricia M.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1375505$$DView record in Pascal Francis
BookMark eNp1kE1LxDAQQIOs4K569pqDeKsmzUdbb-v6CQsK6jnMpkk30iZrkhX891YUQcHTDMx7c3gzNPHBG4SOKDmlpGRn83NKSFNTWRMqZLWDplRUZdEwwSfjzmpWVJSxPTRL6YWMaMX4FMEcL8KwgQjZvRn8mLftOw4WX7lunceTTzmC8xk_xNBFGAbnO7wE322hMwnfv5mI89rgixB6Ax6Db_G18y4bfBmG0UwHaNdCn8zh99xHz9dXT4vbYnl_c7eYLwtdUp6LhmhuBdNgpDArCcwSwVeScmJ53ehWy9pqK2UrBatq3rSNrAwthZArzsvasH108vV3E8Pr1qSsBpe06XvwJmyTKqtSElryETz-BiFp6G0Er11Sm-gGiO-KskoIIkZMfGE6hpSisUq7PFYK_rNIryhRn93VXP3qPnpnf7yfz_8YHyh1hSs
CODEN CNSTFT
CitedBy_id crossref_primary_10_1145_963778_963779
crossref_primary_10_1016_j_jal_2008_10_004
crossref_primary_10_1023_B_CONS_0000006181_40558_37
crossref_primary_10_1080_09528130701538174
crossref_primary_10_1007_s10601_007_9028_6
crossref_primary_10_1016_S0950_7051_03_00026_1
crossref_primary_10_1007_s10479_007_0217_x
crossref_primary_10_1016_j_scico_2012_06_004
crossref_primary_10_1016_j_engappai_2008_10_014
crossref_primary_10_1023_A_1021188818613
crossref_primary_10_1017_S1471068409990093
crossref_primary_10_1016_j_compchemeng_2016_04_030
Cites_doi 10.1007/3-540-59155-9_6
10.1016/0004-3702(80)90051-X
10.1016/0743-1066(94)90033-7
10.1007/3-540-59155-9_1
10.1145/41625.41635
10.1007/3-540-59155-9_15
10.1007/BFb0015252
10.1016/0743-1066(95)00121-2
10.1007/BFb0033845
10.7551/mitpress/4299.003.0038
10.1007/BF00247670
10.1080/088395197118343
10.1007/3-540-58402-1_18
10.1145/129393.129398
ContentType Journal Article
Copyright 2000 INIST-CNRS
Copyright_xml – notice: 2000 INIST-CNRS
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1023/A:1009816801567
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1572-9354
EndPage 301
ExternalDocumentID 1375505
10_1023_A_1009816801567
GroupedDBID -Y2
-~C
.86
.VR
06D
0VY
1N0
1SB
2.D
203
28-
29F
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFGCZ
AFHIU
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BGNMA
BSONS
CAG
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAK
LLZTM
M4Y
MA-
N2Q
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9O
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
ZMTXR
~EX
AAYZH
AESKC
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c214t-90c4f53cae65eb6a3f054b6140f489cdc68fcf66d6537849d967e12556b4428e3
ISSN 1383-7133
IngestDate Sun Nov 09 11:05:41 EST 2025
Mon Jul 21 09:16:08 EDT 2025
Sat Nov 29 07:46:46 EST 2025
Tue Nov 18 21:42:16 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Labelling
Constraint logic programming
Programming language
Boolean logic
Propagator
Language English
License https://www.springernature.com/gp/researchers/text-and-data-mining
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c214t-90c4f53cae65eb6a3f054b6140f489cdc68fcf66d6537849d967e12556b4428e3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 27260124
PQPubID 23500
PageCount 27
ParticipantIDs proquest_miscellaneous_27260124
pascalfrancis_primary_1375505
crossref_citationtrail_10_1023_A_1009816801567
crossref_primary_10_1023_A_1009816801567
PublicationCentury 2000
PublicationDate 2000-00-00
PublicationDateYYYYMMDD 2000-01-01
PublicationDate_xml – year: 2000
  text: 2000-00-00
PublicationDecade 2000
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Constraints : an international journal
PublicationYear 2000
Publisher Springer
Publisher_xml – name: Springer
References 260456_CR11
260456_CR13
260456_CR12
260456_CR31
260456_CR30
260456_CR6
260456_CR5
260456_CR18
260456_CR8
260456_CR15
260456_CR9
260456_CR17
260456_CR16
P. Van Hentenryck (260456_CR28) 1988
260456_CR2
260456_CR1
260456_CR4
260456_CR3
260456_CR22
260456_CR21
J. Csontó (260456_CR10) 1997; 11
260456_CR24
260456_CR23
J. Jaffar (260456_CR20) 1994; 19
N-F. Zhou (260456_CR32) 1997
260456_CR29
260456_CR26
P. Codognet (260456_CR7) 1996; 27
260456_CR25
260456_CR27
J. Jaffar (260456_CR19) 1992; 14
R. Haralick (260456_CR14) 1980; 14
References_xml – ident: 260456_CR24
– ident: 260456_CR13
  doi: 10.1007/3-540-59155-9_6
– ident: 260456_CR26
– volume: 14
  start-page: 263
  year: 1980
  ident: 260456_CR14
  publication-title: Artificial Intelligence
  doi: 10.1016/0004-3702(80)90051-X
– volume: 19
  start-page: 503
  year: 1994
  ident: 260456_CR20
  publication-title: The Journal of Logic Programming
  doi: 10.1016/0743-1066(94)90033-7
– ident: 260456_CR16
– ident: 260456_CR11
– ident: 260456_CR2
  doi: 10.1007/3-540-59155-9_1
– volume-title: B-Prolog User's Manual (Version 2.1)
  year: 1997
  ident: 260456_CR32
– ident: 260456_CR18
  doi: 10.1145/41625.41635
– ident: 260456_CR30
  doi: 10.1007/3-540-59155-9_15
– ident: 260456_CR5
– ident: 260456_CR22
– ident: 260456_CR9
– ident: 260456_CR1
– ident: 260456_CR23
– ident: 260456_CR25
– ident: 260456_CR27
  doi: 10.1007/BFb0015252
– volume: 27
  start-page: 185
  year: 1996
  ident: 260456_CR7
  publication-title: The Journal of Logic Programming
  doi: 10.1016/0743-1066(95)00121-2
– ident: 260456_CR31
– ident: 260456_CR3
  doi: 10.1007/BFb0033845
– ident: 260456_CR17
– ident: 260456_CR15
– ident: 260456_CR21
  doi: 10.7551/mitpress/4299.003.0038
– ident: 260456_CR8
  doi: 10.1007/BF00247670
– volume: 11
  start-page: 59
  year: 1997
  ident: 260456_CR10
  publication-title: Applied Artificial Intelligence
  doi: 10.1080/088395197118343
– ident: 260456_CR6
  doi: 10.1007/3-540-58402-1_18
– ident: 260456_CR12
– volume: 14
  start-page: 339
  issue: 3
  year: 1992
  ident: 260456_CR19
  publication-title: ACM Transactions on Programming Languages and Systems
  doi: 10.1145/129393.129398
– ident: 260456_CR29
– ident: 260456_CR4
– volume-title: Workshop of Constraint Logic Programming
  year: 1988
  ident: 260456_CR28
SSID ssj0009734
Score 1.6349804
Snippet 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...
SourceID proquest
pascalfrancis
crossref
SourceType Aggregation Database
Index Database
Enrichment Source
StartPage 275
SubjectTerms Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Language theory and syntactical analysis
Programming theory
Theoretical computing
Title A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains
URI https://www.proquest.com/docview/27260124
Volume 5
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLink
  customDbUrl:
  eissn: 1572-9354
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009734
  issn: 1383-7133
  databaseCode: RSV
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1baxQxFA5afRDEu7jVah58EMosO5PM7XGplQplEa1SfBkymQQK7ezSbKU_v-fkMpPtIuqDL8MSJpnZPd-enHw5-Q4h7yUXBS9ll-A5zYSLLE8gSkiTlAkhOuij29YWmygXi-r0tP7iU4KMLSdQ9n11fV2v_qupoQ2MjUdn_8Hcw6DQAJ_B6HAFs8P1rww_93nlTtHbBNFoS4FikrmxVSHWeEQAM7MukCsIrKXZx4xOG4xC9H2OLD0S6_oMI9P9bnkBPU0czx4M4xlLLojeClCMHGP8yggT1N9dfDz8aX3SdNyUOvp8fGwj2qnnZwMTMdviICM_CgvfBNe_saPNIzyx2Gm62il-_mWO3Nhy7bHExKzGciF4Crwc57Gwd39rehuSDlNW4nLsLrkHD6yxzMfXbz9GgebSZSCEF78lAxU9cSOCebgSBv5M2lVB2ZrQbZRy8oQ88ssLOneweEruqP4ZeeyXGtQ7cgNNoZpHaHtOxJxGwKEWOHSpqQUOHYFDI-DQATgUgUMBONQDhwJwqAMO9cB5Qb5_Ojw5OEp8AY5EZilfJ_VMcp0zKVSRq7YQTEOA30JAN9O8qmUni0pLXRRdkbOy4nVXF6VKUdSu5bCsVewl2emXvXpFaNayXMkcAkKdoqqcEKlAMwhW5B3nekKm4UdtpFenx2913tgsiYw182bDChPyYeiwcsIsv791b8NK4_0OERPyLlitAeeKO2aiV8sr02QlKu5lfPcPI7wmD5xEA1Jzb8jO-vJK7ZH78tf6zFy-tUC7AZz0mHE
linkProvider Springer Nature
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+comparative+study+of+eight+constraint+Programming+languages+over+the+boolean+and+finite+domains&rft.jtitle=Constraints+%3A+an+international+journal&rft.au=FERNANDEZ%2C+A.+J&rft.au=HILL%2C+P.+M&rft.date=2000&rft.pub=Springer&rft.issn=1383-7133&rft.volume=5&rft.issue=3&rft.spage=275&rft.epage=301&rft_id=info:doi/10.1023%2FA%3A1009816801567&rft.externalDBID=n%2Fa&rft.externalDocID=1375505
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1383-7133&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1383-7133&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1383-7133&client=summon