[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: theorem prover wanted
- To: Roland Zito-wolf <rjz@chaos.cs.brandeis.edu>
- Subject: Re: theorem prover wanted
- From: Vincent Keunen <KEUNEN%BLIULG11.BITNET@CUNYVM.CUNY.EDU>
- Date: Wed, 04 Jul 90 14:50:19 +0200
- In-reply-to: Your message of Fri, 29 Jun 90 09:26:47 edt
- Resent-date: Wed, 11 Jul 90 11:01:54 +0200
- Resent-from: Vincent Keunen <KEUNEN%BLIULG11.BITNET@CUNYVM.CUNY.EDU>
- Resent-message-id: <9007110854.AA03166.@CUNYVM.CUNY.EDU:KEUNEN@BLIULG11.BITNET@cambridge.apple.com>
- Resent-to: info-macl@cambridge.apple.com
Hi Roy,
I don't know exactly what you want, but there is a small "inference
engine" in Abelson & Sussman, Structure and interpretation of Computer
programs (a superb book, by the way). It is written in Scheme, but I
translated it to CL (having fun with the explicit calls to eval and apply
and the functional arguments and parameters...). The engine uses a clause
like language (similar to logic programming) and adopts backward chaining
trough modus ponens.
You can contact me if you need more information.
Vincent Keunen
Manex sc
Liege, Belgium