Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!linus!decvax!harpo!seismo!hao!hplabs!sri-unix!N.WALLACE@SU-SCORE.ARPA From: N.WALLACE@SU-SCORE.ARPA@sri-unix.UUCP Newsgroups: net.ai Subject: PROLONG Message-ID: <3526@sri-arpa.UUCP> Date: Tue, 2-Aug-83 02:14:06 EDT Article-I.D.: sri-arpa.3526 Posted: Tue Aug 2 02:14:06 1983 Date-Received: Fri, 29-Jul-83 06:44:58 EDT Lines: 15 From: WALLACEPROLONG: A VERY SLOW LOGIC PROGRAMMING LANGUAGE ABSTRACT PROLONG was developed at the University of Heiroglyphia over a 22-year period. PROLONG is an implementation of a very well-known technique for deciding whether a given well-formed formula F of first-order logic is a theorem. We first type in the axioms A of our system. Then PROLONG applies the rules of inference successively to the axioms A and the subsequent theorems we derive from A. A matching routine determines whether F is identical to one of these theorems. If the algorithm stops, we know that F is a theorem. If it never stops, we known that F is not.