Abstract
Previous studies of heuristic search techniques have usually considered situations for which the search space could be represented as a tree, which limits the applicability of the results obtained. Here Kowalski is followed and a more general formulation in terms of derivation graph is offered; the graphs correspond rather naturally to the search problems arising in automatic theorem proving and other areas. We consider a family of search procedures controlled by evaluation functions of a very general sort, having the form ƒ Δ ( x, L k ), where L k is that portion of the graph generated thus far by the procedure, and the node x is a candidate for incorporation into L k . Completeness and minimality results are obtained for a number of procedures in this family, including methods analogous to those of Moore, Dijkstra, and Pohl.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
