CLP(ℜ) and some electrical engineering problems

Nevin Heintze, Spiro Michaylov, Peter Stuckey

Research output: Contribution to journalArticleResearchpeer-review

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)231-260
Number of pages30
JournalJournal of Automated Reasoning
Volume9
Issue number2
DOIs
Publication statusPublished - 1 Oct 1992
Externally publishedYes

Keywords

  • circuit analysis
  • circuit synthesis
  • Constraints
  • field analysis
  • logic programming
  • signal flow analysis

Cite this