Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!mit-eddie!uw-beaver!tektronix!sequent!mntgfx!bobk
From: bobk@mntgfx.UUCP
Newsgroups: comp.lang.prolog
Subject: Constraint Logic Programming info sought
Message-ID: <1987Nov9.145220.8991@mntgfx.mentor.com>
Date: Mon, 9-Nov-87 16:52:17 EST
Article-I.D.: mntgfx.1987Nov9.145220.8991
Posted: Mon Nov  9 16:52:17 1987
Date-Received: Thu, 12-Nov-87 02:30:04 EST
Organization: Mentor Graphics Corporation, Beaverton Oregon
Lines: 23
Keywords: prolog,CLP,Constraint Logic Programming

I haven't heard much in this newsgroup about Constraint Logic Programming.
It seems to me that CLP is what I originally thought PROLOG should have
been, before I learned about PROLOG.

Can anyone describe exactly what the differences are between CLP and PROLOG?
Is it practical to modify existing PROLOG interpreters to handle, say,
CLP(R)?  Is it practical to do this with compiled PROLOG systems based on
the Warren Abstract Machine, e.g. SB-Prolog?

I have heard that some CLP systems involve some sort of constraint solver
grafted on to a regular PROLOG system.  What tasks would such a solver
be able to perform in the domain of real numbers?  Would it solve sets
of simultaneous equations and inequalities?  Would it need to do any
algebraic rearrangement of clauses?  Could a CLP(R) meta-interpreter be
written in PROLOG?

Finally, I am looking for bibliographic references about CLP, as well as
any readily-available source code implementations to experiment with.

-- 
Robert J. Kelley
Mentor Graphics Corporation
...!tektronix!sequent!mntgfx!bobk or bobk@mntgfx.MENTOR.COM