On the Cooperation of the Constraint Domains H, R and FD in CFLP - Computer Science > Programming LanguagesReportar como inadecuado




On the Cooperation of the Constraint Domains H, R and FD in CFLP - Computer Science > Programming Languages - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: This paper presents a computational model for the cooperation of constraintdomains and an implementation for a particular case of practical importance.The computational model supports declarative programming with lazy and possiblyhigher-order functions, predicates, and the cooperation of different constraintdomains equipped with their respective solvers, relying on a so-calledConstraint Functional Logic Programming CFLP scheme. The implementation hasbeen developed on top of the CFLP system TOY, supporting the cooperation of thethree domains H, R and FD, which supply equality and disequality constraintsover symbolic terms, arithmetic constraints over the real numbers, and finitedomain constraints over the integers, respectively. The computational model hasbeen 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 ofbenchmarks and shown to behave quite efficiently in comparison to the closestrelated approach we are aware of.To appear in Theory and Practice of Logic Programming TPLP



Autor: S. Estévez-Martín, T. Hortalá-González, Rodríguez-Artalejo, R. del Vado-Vírseda, F. Sáenz-Pérez, A. J. Fernández

Fuente: https://arxiv.org/







Documentos relacionados