home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.prolog
- Path: sparky!uunet!usc!sdd.hp.com!caen!destroyer!ubc-cs!fornax!gregory
- From: gregory@cs.sfu.ca (Gregory Sidebottom)
- Subject: Re: Constraint Handling in Prolog?
- In-Reply-To: kubali@athena.mit.edu's message of Thu, 20 Aug 1992 16:51:01 GMT
- Message-ID: <1992Aug20.203241.28945@cs.sfu.ca>
- Organization: CSS, Simon Fraser University, Burnaby, B.C., Canada
- References: <1992Aug20.165101.6899@athena.mit.edu>
- Date: Thu, 20 Aug 1992 20:32:41 GMT
- Lines: 32
-
- In article <1992Aug20.165101.6899@athena.mit.edu> kubali@athena.mit.edu (Volkan C Kubali) writes:
-
- Could anyone suggest a source of information about constraint
- handling systems in Prolog? The ones relevant to planning/scheduling
- problems would especially be useful.
-
- The Echidna CLP language contains a constraint handling system which
- is relevant to planning and scheduling. A general description of
- Echidna is in:
-
- [HSS*92] Havens, W. S., S. Sidebottom, G. Sidebottom, J. Jones
- and R. Ovans (1992) "Echidna: A Constraint Logic Programming Shell."
- In Proc. Pacific Rim International Conference on Aritificial
- Intelligence, Seuol, Korea, in press.
-
- The numeric constraint handling built into Echidna is well
- suited to scheduling with disjunctive constraints because it is
- possible to represent disjoint sets of real intervals directly. This
- is described in detail in:
-
- [SH92] Sidebottom, G. and W. S. Havens (1992) "Hierarchical Arc
- Consistency for Disjoint Real Intervals in Constraint Logic
- Programming," Computational Intelligence, 8 (4), in press.
-
- I am happy to send copies of these papers if anybody is interested.
- Only paper copies are available, so I'll need snail mail addresses.
-
- Greg
- --
- Greg Sidebottom, | There's not a word that
- Expert Systems Laboratory, Centre for Systems Science | goes here that rhymes
- Simon Fraser University, Burnaby BC V5A 1S6, Canada | with anything. -CVB
-