home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.prolog
- Path: sparky!uunet!mcsun!sunic!sics.se!torkel
- From: torkel@sics.se (Torkel Franzen)
- Subject: Re: Occurs check
- In-Reply-To: mj@cs.brown.edu's message of Mon, 21 Dec 1992 19:56:46 GMT
- Message-ID: <TORKEL.92Dec21220832@lludd.sics.se>
- Sender: news@sics.se
- Organization: Swedish Institute of Computer Science, Kista
- References: <TORKEL.92Dec20104928@bast.sics.se> <1992Dec21.153147.26177@cs.brown.edu>
- <TORKEL.92Dec21175440@bast.sics.se>
- <1992Dec21.195646.3776@cs.brown.edu>
- Date: Mon, 21 Dec 1992 21:08:32 GMT
- Lines: 22
-
- In article <1992Dec21.195646.3776@cs.brown.edu> mj@cs.brown.edu
- (Mark Johnson) writes:
-
- >P.S. I'm interested in this approach. I know of work by
- >Hoefeld and Smolka ``Definite Relations over Constraint Languages'',
- >and Chen and D.S. Warren ``C-Logic of Complex Objects'' and
- >``Abductive Logic Programming'' that describe the decomposition
- >into a relational and constraint components. Any other pointers
- >to relevant literature?
-
- The theoretical treatment of constraint logic programming has been
- solidifying lately, and there are several related formal frameworks.
- I think a "standard treatment" may well soon emerge. My remarks have
- been prompted by work here at SICS on AKL (the Andorra Kernel
- Language), which has a reasonable concurrent constraint logic
- programming subset. The theory of that subset is quite close in many
- ways to the work of Hoefeld and Smolka, but there are some points of
- difference in the formal treatment, partly having to do with concurrency.
- A paper on this has been in the pipeline for a long time and may or may
- not eventually emerge; those who are fanatically interested in this sort
- of thing can get a copy directly from me.
-
-