Return-Path: Delivery-Date: Received: from ted.cs.uidaho.edu (no rfc931) by swan.cl.cam.ac.uk with SMTP (PP-6.4) outside ac.uk; Mon, 19 Apr 1993 22:00:26 +0100 Received: by ted.cs.uidaho.edu (16.6/1.34) id AA13880; Mon, 19 Apr 93 09:41:18 -0700 Sender: info-hol-request@ted.cs.uidaho.edu Errors-To: info-hol-request@ted.cs.uidaho.edu Precedence: bulk Received: from swan.cl.cam.ac.uk by ted.cs.uidaho.edu (16.6/1.34) id AA13875; Mon, 19 Apr 93 09:41:08 -0700 Received: from gadwall.cl.cam.ac.uk (user tl (rfc931)) by swan.cl.cam.ac.uk with SMTP (PP-6.4) to cl; Mon, 19 Apr 1993 17:40:56 +0100 To: info-hol@ted.cs.uidaho.edu Subject: Re: discrimination nets In-Reply-To: Your message of Mon, 19 Apr 93 10:09:39 -0400. <9304191409.AA09397@box.EE.CORNELL.EDU> Date: Mon, 19 Apr 93 17:40:47 +0100 From: Laurent Thery Message-Id: <"swan.cl.ca.332:19.04.93.16.41.00"@cl.cam.ac.uk> >> A few days ago Tom Melham mentioned >> that HOL uses discrimination nets >> in rewriting. Is there any documentation >> describing the use of discrimination >> nets in rewriting, or could someone point >> out a good paper on them? There's a chapter about discrimination nets in the following book: Artificial Intelligence Programming by E. Charniak, C.K. Riesberk, D. Mac Dermott and J. R. Meedhan. LEA edition --Laurent