The following pages link to Compiling constraints in clp(FD) (Q3129502):
Displaying 14 items.
- Structured learning modulo theories (Q511777) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem (Q932211) (← links)
- An analysis of arithmetic constraints on integer intervals (Q2460254) (← links)
- Experiments with the “Oregon Trail Knapsack Problem” (Q2741262) (← links)
- On the implementation of<tt>GNU Prolog</tt> (Q2893102) (← links)
- (Q4499247) (← links)
- Lightweight compilation of (C)LP to JavaScript (Q4911147) (← links)
- 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 (Q4923524) (← links)
- Path consistency in clp(FD) (Q5096309) (← links)
- Constraint functional logic programming over finite domains (Q5309079) (← links)
- Integrating operations research in constraint programming (Q5900889) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- Constraint retraction in FD (Q6567766) (← links)
