The Logical Analysis of Search Algorithms

Yu Zhang · 1999

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.

Read the paper · More papers on PaperTik