Abstract
This paper provides an introduction to finite-domain constraint logic programming (CLP) and its application to problems in scheduling and planning. The fundamentals of CLP are covered and recent developments and trends in the field are indicated. Some current limitations are identified, and areas of research that may contribute to addressing these limitations are suggested.
| Original language | English |
|---|---|
| Pages (from-to) | 73-80 |
| Number of pages | 8 |
| Journal | British Telecom Technology Journal |
| Volume | 13 |
| Issue number | 1 |
| Publication status | Published - 1 Jan 1995 |