Compiling and Executing Declarative Modeling Languages to Gecode

Authors:
Raffaele Cipriano;Agostino Dovier;Jacopo Mauro
Affiliations:
Dipartimento di Matematica e Informatica, Università di Udine, Udine, Italy 33100;Dipartimento di Matematica e Informatica, Università di Udine, Udine, Italy 33100;Dipartimento di Matematica e Informatica, Università di Udine, Udine, Italy 33100
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 4
Cited 3

MiniZinc: towards a standard CP modelling language

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Multivalued action languages with constraints in CLP(FD)

ICLP'07 Proceedings of the 23rd international conference on Logic programming
A comparison of CLP(FD) and ASP solutions to NP-Complete problems

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Hybrid approaches for rostering: a case study in the integration of constraint programming and local search

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics

On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Parameterized models for on-line and off-line use

WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Cologne: a declarative distributed constraint optimization platform

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

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.