Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!floyd!harpo!seismo!hao!hplabs!sri-unix!Kluger.PA@PARC-MAXC.ARPA
From: Kluger.PA@PARC-MAXC.ARPA
Newsgroups: net.ai
Subject: HP Computer Colloquium 3/8/84
Message-ID: <17242@sri-arpa.UUCP>
Date: Wed, 29-Feb-84 16:54:56 EST
Article-I.D.: sri-arpa.17242
Posted: Wed Feb 29 16:54:56 1984
Date-Received: Fri, 9-Mar-84 01:26:24 EST
Lines: 34

[Forwarded from the SRI-AI bboard by Laws@SRI-AI.]


                Mark E. Stickel
                SRI International

                A Prolog Technology Theorem Prover

An extension of Prolog, based on the model elimination theorem-proving
procedure, would permit production of a Prolog technology theorem prover
(PTTP). This would be a complete theorem prover for the full first-order
predicate calculus, not just Horn clauses, and provide capabilities for
full handling of logical negation and indefinite answers. It would be
capable of performing inference operations at a rate approaching that of
Prolog itself--substantially faster than conventional theorem-proving
systems.

PTTP differs from Prolog in its use of unification with the "occurs
check" for soundness, the complete model elimination input inference
procedure, and a complete staged depth-first search strategy. The use of
an input inference procedure and depth-first search minimize the
differences between this theorem-proving method and Prolog and permit the
use of highly efficient Prolog implementation techniques.

        Thursday, March 8, 1984 4:00 pm
        Hewlett Packard
        Stanford Division
        5M Conference room

        1501 Page Mill Rd
        Palo Alto

        *** Be sure to arrive at the building's lobby on time, so that you may
be escorted to the meeting room.