Author(s)

G. Kelleher & P. Retif

Abstract

Work on the use of RMS in conjunction with constraint based scheduling systems has been an area of interest over a number of years (Mott et al^, Martins 10). The application of RMS techniques, whilst attractive for a range of reasons have been hampered by the computational properties of the RMS's available. Broadly the RMS of choice for scheduling applications, de Kleers ATMS (de Kleer*), suffers from a major drawback in that, unless great care is taken, it may become the major consumer of resources in a reasoning system. This drawback has led many people to conclude that, whilst RMS could provide useful functionality, their computational costs outweigh the advantages of their application in scheduling. Recent advances in the control of the behaviour of the ATMS, based on a variety of

Keywords