Xref: utzoo comp.lang.prolog:2400 comp.ai:6023
Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!uwm.edu!zaphod.mps.ohio-state.edu!samsung!munnari.oz.au!goanna!ok
From: ok@goanna.oz.au (Richard O'keefe)
Newsgroups: comp.lang.prolog,comp.ai
Subject: Re: Information request for temporal languages.
Summary: LEGOL
Keywords: Temporal Logic Programming, Interval Arithmetic.
Message-ID: <2886@goanna.oz.au>
Date: 20 Feb 90 04:36:27 GMT
References: <2512@cs-spool.calgary.UUCP> <36219@iuvax.cs.indiana.edu>
Followup-To: comp.lang.prolog
Organization: Comp Sci, RMIT, Melbourne, Australia
Lines: 12

In article <36219@iuvax.cs.indiana.edu>, jwmills@iuvax.cs.indiana.edu (Jonathan Mills) writes:
> In article <2512@cs-spool.calgary.UUCP> kaushik@cpsc.ucalgary.ca (Vinit Kaushik) writes:
> >	I am currently looking for literature/code regarding available
> >temporal/constraint-based languages. Any references/suggestions would be
> >most welcome.

There is (or at any rate, was) a project at the London School of
Economics under Ronald Stamper working on a language for expressing
legislation and business rules.  The language is called LEGOL.  Some
of the people at Imperial College explored the relationship between
LEGAL and Prolog.  If you look back through the last 10 years of
The Computer Journal you should find a couple of papers on LEGOL.