The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP(
) language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation.
In this paper we illustrate the practical applicability of CLP(
) with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(
). A detailed look at some of the more important programming techniques highlights the ability of CLP(
) to support well-known, powerful techniques from constraint programming. Our thesis is that CLP(
) is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.
Keywords Constraints - logic programming - circuit analysis - circuit synthesis - field analysis - signal flow analysis
An earlier version of this paper appeared in the proceedings of the 4th International Conference on Logic Programming, Melbourne, May 1987. Much of this work was carried out while the authors were at Monash University, Melbourne, Australia.