On the cooperation of the constraint domains [Hamiltonian (script capital H)], [SCRIPT CAPITAL R], and [SCRIPT CAPITAL F] in CFLP

Abstract This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming 2009-07, Vol.9 (4), p.415
Main Authors: ESTÉVEZ-MARTÍN, S, HORTALÁ-GONZÁLEZ, T, RODRÍGUEZ-ARTALEJO, M, DEL VADO-VÍRSEDA, R, SÁENZ-PÉREZ, F, FERNÁNDEZ, A J
Format: Article
Language:English
Subjects:
Constraint modelling
Cooperation
Declarative programming
Domains
Functional programming
Integers
Logic programming
Real numbers
Semantics
Solvers
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Abstract This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of different constraint domains equipped with their respective solvers, relying on a so-called constraint functional logic programming (CFLP) scheme. The implementation has been developed on top of the CFLP system , supporting the cooperation of the three domains [Hamiltonian (script capital H)], [SCRIPT CAPITAL R], and [SCRIPT CAPITAL F] , which supply equality and disequality constraints over symbolic terms, arithmetic constraints over the real numbers, and finite domain constraints over the integers, respectively. The computational model has been proved sound and complete w.r.t. the declarative semantics provided by the CFLP scheme, while the implemented system has been tested with a set of benchmarks and shown to behave quite efficiently in comparison to the closest related approach we are aware of. [PUBLICATION ABSTRACT]
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068409003780