CLP(Intervals) Revisited

The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in CLP(BNR), complex constraints are manipulated as a whole, enabling more sophisticated narrowing procedures to be applied in the solver. This idea is embodied in a new CLP language Newton whose operational semantics is based on the notion of box-consistency, an approximation of arcconsistency, and whose implementation uses Newton interval method. Experimental results indicate that Newton outperforms existing languages by an order of magnitude and is competitive with some state-of-the-art tools on some standard benchmarks. Limitations of our current implementation and directions for further work are also identi ed.

• Type: Conference
• Year: 1994
• Where: SLP
• Authors: Frédéric Benhamou, David A. McAllester, Pascal Van Hentenryck
• Keywords: Complex Constraints, Simple Primitive Constraints, SLP 1994, Sophisticated Narrowing Procedures