Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Building Constraint Solvers with HAL
Proceedings of the 17th International Conference on Logic Programming
Constraint Processing
Logic programming in the context of multiparadigm programming: the Oz experience
Theory and Practice of Logic Programming
A lazy narrowing calculus for declarative constraint programming
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Constraint functional logic programming over finite domains
Theory and Practice of Logic Programming
Validity of the single processor approach to achieving large scale computing capabilities
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Multi-paradigm declarative languages
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Maintaining state in propagation solvers
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
FCST '10 Proceedings of the 2010 Fifth International Conference on Frontier of Computer Science and Technology
Parameterized models for on-line and off-line use
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Integrating ILOG CP technology into TOY
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
Constraint Functional Logic Programming (CFLP) integrates lazy narrowing with constraint solving. It provides a high modeling abstraction, but its solving performance can be penalized by lazy narrowing and solver interface surcharges. As for real-world problems most of the solving time is carried out by solver computations, the system performance can be improved by interfacing state-of-the-art external solvers with proven performance. In this work we depart from the CFLP system $\mathcal{TOY(FD})$ , implemented in SICStus Prolog and supporting Finite Domain ( $\mathcal{FD}$ ) constraints by using its underlying Prolog $\mathcal{FD}$ solver. We present a scheme describing how to interface an external CP( $\mathcal{FD}$ ) solver to $\mathcal{TOY(FD})$ , and easily adaptable to other Prolog CLP or CFLP systems. We prove the scheme to be generic enough by interfacing Gecode and ILOG solvers, and we analyze the new performance achieved.