论文信息 - CHIP and Propia

CHIP and Propia

CHIP and Propia are new logic languages combining the declarative style of logic programming with the efficiency of constraint solving techniques. CHIP and Propia fall outside the usual CLP Scheme [3], in that besides extensions to unification, they also introduce constraint propagation which modifies the logic programming search. In this brief survey we shall discuss propagation over finite domains in CHIP, and CHIP's built-in boolean and rational constraint solvers; then we shall describe Propia's "generalised propagation"; finally we shall mention some implementations of CHIP and Propia.

Mark Wallace | Thierry Le Provost

[1] Nicolas Beldiceanu,et al. Overview of the CHIP Compiler System , 1993, WCLP.

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

[3] F. Lockwood Morris,et al. Domains for Logic Programming , 1992, Theor. Comput. Sci..

[4] Mark Wallace,et al. Domain Independent Propagation , 1992, FGCS.

[5] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.