Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!usc!polyslo!jdudeck
From: jdudeck@polyslo.CalPoly.EDU (John R. Dudeck)
Newsgroups: comp.object
Subject: Constraint Logic Programming (was: proving programs)
Message-ID: <25ae8b54.b1d@polyslo.CalPoly.EDU>
Date: 13 Jan 90 01:58:44 GMT
References: <21140@pasteur.Berkeley.EDU>
Reply-To: jdudeck@polyslo.CalPoly.EDU (John R. Dudeck)
Organization: Cal Poly State University -- San Luis Obispo
Lines: 15


In article <21140@pasteur.Berkeley.EDU> faustus@yew.Berkeley.EDU (Wayne Christopher) writes:
>Speaking of constraint-solving systems, has anybody had any experience
>using constraint logic programming (CLP) systems?  Alan Borning at U.
>Washington is working on this stuff, and so are some people at Monash
>University in Australia.  Is there anybody else?  Has CLP been applied
>to any real problems?

Some of us read this newsgroup to learn about things we otherwise don't
encounter.  Would somebody like to give a 2-paragraph explanation of
what CLP is, say, compared to PROLOG?

Does the TRILOGY language from Complete Logic Systems, Vancouver, B.C.,
have anything to do with CLP?


-- 
John Dudeck                           "You want to read the code closely..." 
jdudeck@Polyslo.CalPoly.Edu             -- C. Staley, in OS course, teaching 
ESL: 62013975 Tel: 805-545-9549          Tanenbaum's MINIX operating system.