Article View: comp.lang.prolog
Article #1851Theorem Prover
From: Dr. Ranga R. Vemuri
Date: Mon, 25 Feb 1991 22:53
Date: Mon, 25 Feb 1991 22:53
16 lines
880 bytes
880 bytes
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 ______________
Technical Details
Message-ID:
<7569@uceng.UC.EDU>Path:
arc1-ca.pugleaf.net!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!rangaShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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