Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!paperboy!think.com!samsung!caen!news.cs.indiana.edu!uceng!ranga
From: ranga@uceng.UC.EDU (Dr. Ranga R. Vemuri)
Newsgroups: comp.lang.prolog
Subject: Theorem Prover
Keywords: Boyer-Moore, Theorem Provers
Message-ID: <7569@uceng.UC.EDU>
Date: 25 Feb 91 22:53:47 GMT
Followup-To: ranga@uceng.uc.edu
Organization: College of Engg., Univ. of Cincinnati
Lines: 16


I have heard that someone implemented a theorem prover in Prolog
based on the Boyer-Moore computational logic.  Can anyone please give
me pointers to this.  

Also, are there any public domain (or available at no cost..)
theorem provers (propositional or first-order or higher-order) implemented in
Prolog.  

Thanks for the info.

- ranga

  ranga@uceng.uc.edu

______________