CAL: A theoretical background of constraint logic programming and its applications
Constraint logic programming (CLP) is an extension of logic programming by introducing the facility of writing and solving constraints in a certain domain. CAL (Contrainte avec Logique) is a CLP language in which (possibly nonlinear) polynomial equations can be written as constraints, while almost all the other CLP language proposed so far have concentrated only on linear equations and inequations. This paper describes a general semantics of CLP including CAL, and shows the validity of CAL in this framework.
scientific article; zbMATH DE number 4135382
scientific article