Starting at a seminal paper published by J. Jaffar and J. L. Lassez in 1987, Constraint Logic Programming (CLP) has developed as a powerful programming paradigm which supports a clean combination of logic (in the form of Horn clauses) and domain-specific methods for constraint satisfaction, simplification and optimization. The well established mathematical foundations of logic programming have been successfully extended to CLP. Simultaneously, practical applications of CLP have arisen in many fields. On the other hand, the combination of logic programming with other declarative programming paradigms (especially functional programming) has been widely investigated during the last decade, leading to useful insights for the design of more expressive declarative languages. The first attempt to combine functional and logic languages was done by J. A. Robinson and E. E. Sibert when proposing the language LOGLISP.
For the entire collection see [Zbl 0961.00024].