Re: Occurs check (really constraints)

Article View: comp.lang.prolog

Article #2169

#2169

From: Jamie Andrews
Date: Wed, 23 Dec 1992 01:09

17 lines
1339 bytes

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?

     One other I know of is "Constraint Simplification Rules",
by Thom Fruehwirth (thom@ecrc.de), ECRC tech report 92-18.
He describes a framework of delay declarations and special
clause-like rules which are used by the system to store and
simplify constraints.  It looks like a very general system.

--Jamie.
  jamie@cs.sfu.ca
"The Tao's net encompasses the whole universe."  - tao te ching

Technical Details

Message-ID: <1992Dec23.010930.2892@cs.sfu.ca>

Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!rpi!gatech!destroyer!cs.ubc.ca!fornax!jamie

References: <1992Dec21.153147.26177@cs.brown.edu> <TORKEL.92Dec21175440@bast.sics.se> <1992Dec21.195646.3776@cs.brown.edu>

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.prolog
Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!rpi!gatech!destroyer!cs.ubc.ca!fornax!jamie
From: jamie@cs.sfu.ca (Jamie Andrews)
Subject: Re: Occurs check (really constraints)
Message-ID: <1992Dec23.010930.2892@cs.sfu.ca>
Organization: CSS, Simon Fraser University, Burnaby, B.C., Canada
References: <1992Dec21.153147.26177@cs.brown.edu> <TORKEL.92Dec21175440@bast.sics.se> <1992Dec21.195646.3776@cs.brown.edu>
Date: Wed, 23 Dec 1992 01:09:30 GMT
Lines: 17

Reply to Parent Message