Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!bonnie!akgua!sdcsvax!sdcrdcf!hplabs!sri-unix!SHEBS@UTAH-20.ARPA
From: SHEBS@UTAH-20.ARPA
Newsgroups: net.ai
Subject: Re: Induction
Message-ID: <12457@sri-arpa.UUCP>
Date: Wed, 26-Sep-84 12:42:28 EDT
Article-I.D.: sri-arpa.12457
Posted: Wed Sep 26 12:42:28 1984
Date-Received: Sun, 30-Sep-84 04:49:43 EDT
Lines: 10

From:  Stan Shebs 

There's another name for "induction" on one case: generalization.  Lenat's
AM and the Boyer-Moore theorem prover are both capable of doing
generalizations, and there are probably others that can do it also.
Not too hard really;  if you've set up just the right formalism,
generalization amounts to easily-implemented syntactic mutations (now
all we need is a program to come up with the right formalisms!)

                                                        stan shebs