论文信息 - Programming in CLP(BNR)

Programming in CLP(BNR)

CLP(BNR) is a constraint system based on relational interval arithmetic and forms part of BNR Prolog /v.4. This is a much more powerful system than previous versions and allows a much wider class of problems to be handled, including discrete domain problems and boolean equations. It is also integrated more closely into Prolog, thus providing for smoother and more exible interaction between Prolog and the constraint system. This paper describes the programming interface and gives some simple programming examples.

Frédéric Benhamou | William J. Older | W. Older | F. Benhamou

[1] Joxan Jaffar,et al. Methodology and Implementation of a CLP System , 1987, ICLP.

[2] W. Older,et al. Extending Prolog with Constraint Arithmetic on Real Intervals , 1990 .

[3] Pascal Van Hentenryck,et al. Solving Large Combinatorial Problems in Logic Programming , 1990, J. Log. Program..

[4] André Vellino,et al. Constraint Arithmetic on Real Intervals , 1993, WCLP.

[5] Hoon Hong. RISC-CLP(Real): Logic Programming with Non-linear Constraints over the Reals , 1991, WCLP.