An Admissible and Optimal Algorithm for Searching AND/OR Graphs

[1]  James R. Slagle,et al.  Finding resolution proofs and using duplicate goals in and/or trees , 1971, Inf. Sci..

[2]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[3]  James R. Slagle.  Heuristic Search Programs , 1970 .

[4]  Erik Sandewall.  A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees , 1969, JACM.

[5]  Erik Sandewall.  Concepts and Methods for Heuristic Search , 1969, IJCAI.

[6]  James R. Slagle,et al.  Experiments With Some Programs That Search Game Trees , 1969, JACM.

[7]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8]  James R. Slagle,et al.  Experiments With a Multipurpose, Theorem-Proving Heuristic Program , 1968, JACM.

[9]  Nils J. Nilsson,et al.  Searching problem-solving and game-playing trees for minimal cost solutions , 1968, IFIP Congress.

[10]  S. Amarel.  An Approach to Heuristic Problem Solving and Theorem Proving in the Prepositional Calculus , 1967 .

[11]  Allen Newell,et al.  GENERALITY AND GPS , 1967 .

[12]  J. Doran,et al.  Experiments with the Graph Traverser program , 1966, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[13]  Herbert A. Simon,et al.  A chess mating combinations program , 1966, AFIPS '66 (Spring).

[14]  James R. Slagle,et al.  A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus , 1963, JACM.

[15]  H. Gelernter,et al.  Realization of a geometry theorem proving machine , 1995, IFIP Congress.

[16]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..