Article View: comp.lang.prolog
Article #168Re: ?: Efficient implementation of HASHING in PROLOG
From: Michael A. Covington
Date: Thu, 09 Apr 1992 00:40
Date: Thu, 09 Apr 1992 00:40
9 lines
959 bytes
959 bytes
Prolog already uses hashing to look up facts and rules. Hashing is applied to the predicate name itself (with arity) and (in most implementations) to the first argument of the predicate. -- ========================================================================== Michael A. Covington, Ph.D. | mcovingt@uga.cc.uga.edu | ham radio N4TMI Artificial Intelligence Programs | U of Georgia | Athens, GA 30602 U.S.A. ==========================================================================
Technical Details
Message-ID:
<1992Apr9.004044.22425@athena.cs.uga.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!usc!wupost!emory!athena.cs.uga.edu!mcovingtReferences:
<1992Apr8.234624.7922@cl.cam.ac.uk>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!usc!wupost!emory!athena.cs.uga.edu!mcovingt From: mcovingt@athena.cs.uga.edu (Michael A. Covington) Newsgroups: comp.lang.prolog Subject: Re: ?: Efficient implementation of HASHING in PROLOG Keywords: Prolog, Hashing Message-ID: <1992Apr9.004044.22425@athena.cs.uga.edu> Date: 9 Apr 92 00:40:44 GMT References: <1992Apr8.234624.7922@cl.cam.ac.uk> Organization: University of Georgia, Athens Lines: 9