TY - JOUR
AU1 - Rodohan, D. P.
AU2 - Glover, R. J.
AB -  An overview of t h e A* A r c h i t e c t u r e a logic programming for o p t i m i s a t i o n environment problems in D.P.Rodohan R.J.Glover Dept of Electrical Engineering and Electronics Brunel University Uxbridge Middlesex UB8 3PH UK email: D.P.Rodohan@brunel.ac.uk Raymond.Glover@brunel.ac.uk Keywords [Prolog, Logic programming, Content Addiessable memory, Parallel computing, A* algorithm] Abstract Search of a state space is a common function in artificial intelligence applications consuming a large proportion of the total processing time. In this paper we propose a hierarchical architecture using content addressable memory to accelerate the A* algorithm in a Prolog system and remove the associated high memory overheads. 1.Introduction The A* algorithm [Ni180,Pr184] is commonly used to find the optimal path through a state space and is generally accepted as the best method [Pr188]. The search is guided by a heuristic function, f(n), which is calculated for each node as follows: f(n) = g(n) + h(n), where g(n) is the accrued cost function, usually search depth, and h(n) is the heuristic estimate of the total remaining cost of the current solution path. The accuracy of the heuristic determines 
TI - An overview of the A architecture for optimisation problems in a logic programming environment
JF - ACM SIGARCH Computer Architecture News
DO - 10.1145/122576.122589
DA - 1991-07-01
UR - https://www.deepdyve.com/lp/association-for-computing-machinery/an-overview-of-the-a-architecture-for-optimisation-problems-in-a-logic-0HfESuc2EJ
SP - 124
VL - 19
IS - 4
DP - DeepDyve
ER -