Constraint logic programming for scheduling and planning

J. Lever, M. Wallace, B. Richards

Research output: Contribution to journalArticleResearchpeer-review

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 languageEnglish
Pages (from-to)73-80
Number of pages8
JournalBritish Telecom technology journal
Volume13
Issue number1
Publication statusPublished - 1 Jan 1995

Cite this

@article{c51f3ec7df01413d8ef3b71724e88e64,
title = "Constraint logic programming for scheduling and planning",
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.",
author = "J. Lever and M. Wallace and B. Richards",
year = "1995",
month = "1",
day = "1",
language = "English",
volume = "13",
pages = "73--80",
journal = "British Telecom technology journal",
issn = "0265-0193",
number = "1",

}

Constraint logic programming for scheduling and planning. / Lever, J.; Wallace, M.; Richards, B.

In: British Telecom technology journal, Vol. 13, No. 1, 01.01.1995, p. 73-80.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Constraint logic programming for scheduling and planning

AU - Lever, J.

AU - Wallace, M.

AU - Richards, B.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029232136&partnerID=8YFLogxK

M3 - Article

VL - 13

SP - 73

EP - 80

JO - British Telecom technology journal

JF - British Telecom technology journal

SN - 0265-0193

IS - 1

ER -