### Some Binary Derivation SystemsSome Binary Derivation Systems

Access Restriction
Subscribed

 Author Sibert, E. E. ♦ Michie, D. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1974 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science 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 theoremproving and other areas. We consider a family of search procedures controlled by evaluation functions of a very general sort, having the form ƒDgr;(x, Lk), where $\textit{Lk}$ is that portion of the graph generated thus far by the procedure, and the node $\textit{x}$ is a candidate for incorporation into $\textit{Lk}.$ Completeness and minimality results are obtained for a number of procedures in this family, including methods analogous to those of Moore, Dijkstra, and Pohl. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1974-04-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 21 Issue Number 2 Page Count 16 Starting Page 175 Ending Page 190

#### Open content in new tab

Source: ACM Digital Library