Theorem prover

Article View: comp.lang.prolog

Article #4200

#4200

From: SVEN AXELSSON
Date: Sat, 17 Feb 1990 00:31

14 lines
984 bytes

I'm currently doing research on computational discourse semantics and I
wonder if anybody has a theorem prover, written in Prolog, to share with
me. It should (of course) be for a logic more expressive than horn
clause logic, and as I want to be able to follow the structure of the
proofs, preferably a non-resolution method should be used (a tableaux
method, for example). Programs and/or advices and/or pointers to
relevant literature are most welcome.

Thanks for your help.

Torbjoern Lager                 E-mail: lager@hum.gu.se 
Department of Philosopy 
S-412 98 Gothenburg 
Sweden

Technical Details

Message-ID: <7841@tekno.chalmers.se>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!mcsun!sunic!chalmers!tekno.chalmers.se!d83_sven_a

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!mcsun!sunic!chalmers!tekno.chalmers.se!d83_sven_a
From: d83_sven_a@tekno.chalmers.se (SVEN AXELSSON)
Newsgroups: comp.lang.prolog,comp.ai
Subject: Theorem prover
Message-ID: <7841@tekno.chalmers.se>
Date: 17 Feb 90 00:31:05 GMT
Organization: Chalmers Univ. of Technology, Gothenburg, Sweden
Lines: 14