Path: utzoo!mnetor!uunet!lll-winken!lll-lcc!ames!hao!boulder!sunybcs!bingvaxu!leah!uwmcsd1!marque!gryphon!cadovax!trwrb!aero!srt
From: srt@aero.ARPA (Scott R. Turner)
Newsgroups: comp.ai
Subject: Re: Student versions of OPS5
Message-ID: <27336@aero.ARPA>
Date: 16 Mar 88 17:20:25 GMT
References: <1110@pembina.UUCP> <1501@netmbx.UUCP>
Reply-To: srt@aero.UUCP (Scott R. Turner)
Organization: The Aerospace Corporation, El Segundo, CA
Lines: 16
Keywords: OPS5, IBM PC/XT/AT

In article <1501@netmbx.UUCP> muhrth@db0tui11.BITNET (Thomas Muhr) writes:
>I have now available a few common-lisp
>sources (each about 100KB big) which I will try to convert to a PC-runnable
>version in the near future.

It should be possible to write an OPS5-like language in a lot less than 
100K.  The only difficult part of OPS5 to implement is the RETE algorithm.
Throw that out, ignore some of the rules for determining which rule out 
of all the applicable rules to use (*), and you should be able to implement
OPS5 in a couple of days.  Of course, this version will be slow and GC 
every few minutes or so, but those problems will be present to some extent
in any version written in Lisp.

(*) My experience is that most OPS5 programmers (not that there are many) 
ignore or actively counter the "pick the most specific/least recently used"
rules anyway.

					-- Scott Turner