%0 Journal Article
%T The Logical Analysis of Search Algorithms<br>搜索算法的逻辑分析*
%A ZHANG Yu-ping
%A <br>张玉平
%J 软件学报
%D 1999
%I 
%X The state space, search heuristics, and move generator in searching solutions to a given problem are characterized by first order language, which implies that the logical properties of a search algorithm are determined by its state space, that is, the logic describing the searching process has compactness and the class of initial states has finite close property.
%K Search algorithm
%K first order logic
%K model<br>搜索算法
%K 一阶逻辑
%K 模型
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C666BE03E807A838&yid=B914830F5B1D1078&vid=F3090AE9B60B7ED1&iid=0B39A22176CE99FB&sid=A58CF3BAE79427D0&eid=F1A8654ADB4E656E&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=3