Programmed Search in a Timetabling Problem over Finite Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Constraint functional logic programming over finite domains
Theory and Practice of Logic Programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
Improving the performance of FD constraint solving in a CFLP system
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
The constraint functional logic programming system $\mathcal{TOY}$ has been using the SICStus Prolog finite domain ($\mathcal{FD}$) constraint solver. In this work, we show how to integrate the ILOG CP $\mathcal{FD}$ constraint solving technology into this system, with the aim of improving its application domain and performance. We describe our implementation emphasizing the synchronization between Herbrand computations in the $\mathcal{TOY}$ side and $\mathcal{FD}$ constraint solving in the ILOG CP side. Finally, performance results are reported and discussed.