Chapter 12 Constraint logic programming

Abstract

Publisher This chapter reviews that constraint logic programming (CLP) is the merger of two declarative paradigms: constraint solving and logic programming. As both constraint solving and logic programs are based on mathematical relations the merger is natural and convenient. CLP encourages experimentation and fast algorithm development by narrowing the gap between the logic and the solving algorithms. This is because CLP can express both conceptual and design models and it can also express mappings from conceptual to design models. The “conceptual” model of a problem means the precise formulation of the problem in logic, and the “design” models of the problem means its algorithmic formulati..