Breadth-first search: Some surprising results

https://doi.org/10.1016/0004-3702(73)90006-4Get rights and content

Abstract

Although breadth-first search procedures cannot explore truly large search spaces, actual implementations of such procedures can result in surprisingly powerful problem-solvers that outperform more sophisticated heuristic search procedures. We describe two breadth-first search procedures. The first one, S&R, proves theorems from Principia of Whitehead and Russell, and is compared to two versions of the Logic Theorist. Previous estimates of the size of the search space are significantly reduced. When theorems are proved in an optimal order, this order differs markedly from that found in Principia, while more general theorems than those of Principia are often found.

The second system, S&M, adapts breadth-first search to locally infinite search spaces in systems of rewriting rules. S&M is compared extensively to the heuristic theorem-prover of Quinlan and Hunt, and to some other theorem provers.

References (19)

  • G.W. Ernst et al.

    GPS: a Case Study in Generality and Problem Solving

    (1969)
  • S. Amarel

    On representations of problems of reasoning about actions

  • A.N. Whitehead et al.

    Principia Mathematica: to 56

    (1962)
  • A. Newell et al.

    Empirical explorations with the logic theory machine: A case study in heuristics

  • A. Newell et al.

    Human Problem Solving

    (1972)
  • E. Stefferud

    The logic theory machine: A model heuristic program

  • L. Siklóssy et al.

    Heuristic search vs. exhaustive search

  • L. Siklóssy et al.

    Experiments in search

  • J.R. Quinlan et al.

    A formal deductive problem-solving system

    J. ACM

    (1968)
There are more references available in the full text version of this article.

Cited by (7)

View all citing articles on Scopus

Work partially supported by grant GM15769-04 from the National Institute of Health.

2

Present address: U.S. Naval Nuclear Power School, Mare Island, CA.

View full text