CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
The Ciao clp(FD) library. A modular CLP extension for Prolog
Authors
Emilio Jesús Gallego Arias
R. Haemmerlé
Manuel V. Hermenegildo
José Francisco Morales Caballero
Publication date
1 January 2013
Publisher
Facultad de Informática (UPM)
View
on
arXiv
Abstract
We present a new free library for Constraint Logic Programming over Finite Domains, included with the Ciao Prolog system. The library is entirely written in Prolog, leveraging on Ciao's module system and code transformation capabilities in order to achieve a highly modular design without compromising performance. We describe the interface, implementation, and design rationale of each modular component. The library meets several design goals: a high level of modularity, allowing the individual components to be replaced by different versions; highefficiency, being competitive with other TT> implementations; a glass-box approach, so the user can specify new constraints at different levels; and a Prolog implementation, in order to ease the integration with Ciao's code analysis components. The core is built upon two small libraries which implement integer ranges and closures. On top of that, a finite domain variable datatype is defined, taking care of constraint reexecution depending on range changes. These three libraries form what we call the TT> kernel of the library. This TT> kernel is used in turn to implement several higher-level finite domain constraints, specified using indexicals. Together with a labeling module this layer forms what we name the TT> solver. A final level integrates the CLP (J7©) paradigm with our TT> solver. This is achieved using attributed variables and a compiler from the CLP (J7©) language to the set of constraints provided by the solver. It should be noted that the user of the library is encouraged to work in any of those levels as seen convenient: from writing a new range module to enriching the set of TT> constraints by writing new indexicals
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Archivo Digital UPM
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:oa.upm.es:15394
Last time updated on 17/07/2013
Servicio de Coordinación de Bibliotecas de la Universidad Politécnica de Madrid
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:oa.upm.es:15394
Last time updated on 10/02/2018