Compiling and executing declarative modeling languages to gecode

Raffaele Cipriano*, Agostino Dovier, Jacopo Mauro

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

We developed a compiler from SICStus Prolog CLP(FD) to Gecode and a compiler from MiniZinc to Gecode. We compared the running times of the executions of (standard) codes directly in the three languages and of the compiled codes for some classical problems. Performances of the compiled codes in Gecode improve those in the original languages and are comparable with running time of native Gecode code. This is a first step towards the definition of a unified declarative modeling tool for combinatorial problems.

Original languageEnglish
Title of host publicationLogic Programming - 24th International Conference, ICLP 2008, Proceedings
Number of pages5
Publication date1. Dec 2008
Pages744-748
ISBN (Print)3540899812, 9783540899815
DOIs
Publication statusPublished - 1. Dec 2008
Externally publishedYes
Event24th International Conference on Logic Programming, ICLP 2008 - Udine, Italy
Duration: 9. Dec 200813. Dec 2008

Conference

Conference24th International Conference on Logic Programming, ICLP 2008
Country/TerritoryItaly
CityUdine
Period09/12/200813/12/2008
SponsorAssociation for Logic Programming, New Mexico State University, National Science Foundation, National ICT Australia, University of Udine
SeriesLecture Notes in Computer Science
Volume5366 LNCS
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Compiling and executing declarative modeling languages to gecode'. Together they form a unique fingerprint.

Cite this