Compiling constraints in clp(FD)
From MaRDI portal
Publication:3129502
DOI10.1016/0743-1066(95)00121-2zbMath0874.68054OpenAlexW1982482731MaRDI QIDQ3129502
Daniel Diaz, Philippe Codognet
Publication date: 1996
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(95)00121-2
Related Items (13)
On the implementation ofGNU Prolog ⋮ Mechanically proving termination using polynomial interpretations ⋮ Constraint functional logic programming over finite domains ⋮ Design for AJACS, yet another Java constraint programming framework1 1The authors would like to thank the anonymous referees for their constructive review of an earlier version of this article. Universidade de Évora, CENTRIA and FundaçLãTo da CiêCncia e Tecnologia (under contract PRAXIS P/EEI/10191/98 “OAR”) are acknowledged for their support of the work described herein. ⋮ Path consistency in clp(FD) ⋮ Fifty Years of Prolog and Beyond ⋮ Unnamed Item ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ An analysis of arithmetic constraints on integer intervals ⋮ Experiments with the “Oregon Trail Knapsack Problem” ⋮ Structured learning modulo theories ⋮ Integrating operations research in constraint programming ⋮ Lightweight compilation of (C)LP to JavaScript
Uses Software
This page was built for publication: Compiling constraints in clp(FD)
