×

An admissible and optimal algorithm for searching AND/OR graphs. (English) Zbl 0227.68016


MSC:

68R10 Graph theory (including graph drawing) in computer science
68P10 Searching and sorting
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Amarel, S., An Approach to Heuristic Problem Solving and Theorem Proving in the Propositional Calculus, (Hart, J. F.; Takasu, S., Systems and Computer Science (1967), University of Toronto Press: University of Toronto Press Toronto, Ontario, Canada), 125-220
[2] Ernst, G. W.; Newell, A., Generality and GPS, Doctoral dissertation at the Carnegie Institute of Technology (January, 1967), Pittsburgh, PA
[3] Nilsson, N. J., Problem Solving Methods in Artificial Intelligence (1971), McGraw-Hill
[4] Nilsson, N. J., Searching Problem-Solving and Game Playing Trees for Minimal Cost Solutions, H 125-130 (1968), IFIPS Congress Preprints
[5] Sandewall, E. J., Concepts and Methods for Heuristic Search, (Proc. International Joint Conference on Artificial Intelligence. Proc. International Joint Conference on Artificial Intelligence, Washington, D.C. (1969))
[6] Slagle, J. R., Heuristic Search Programs, (Banerji, R.; Mesarovic, M. D., Formal Systems and Non-Numerical Problem Solving by Computers (1970), Springer-Verlag: Springer-Verlag Berlin), 246-273 · Zbl 0208.19802
[7] Slage, J. R.; Bursky, P., Experiments with a Multipurpose, Theorem-Proving Heuristic Program, J. ACM, 15, No. 1, 85-99 (Jan. 1968)
[8] Slagle, J. R.; Koniver, D. A., Finding Resolution Proofs and Using Duplicate Goals in AND/OR Trees, Information Sciences Journal (1971), To appear in · Zbl 0226.68043
[9] Baylor, G.W. and Simon, H.A. Chess Mating Combinations Program. Proceedings of the 1966 Spring Joint Computer Conference; Baylor, G.W. and Simon, H.A. Chess Mating Combinations Program. Proceedings of the 1966 Spring Joint Computer Conference
[10] Doran, J. E.; Michie, D., Experiments with the Graph Tranverser Program, Proc. Roy. Soc. A., 294, 1437, 235-259 (1966)
[11] (Feigenbaum, E.; Feldman, J., Computer and Thought (1963), McGraw-Hill Book Company: McGraw-Hill Book Company New York) · Zbl 0135.18305
[12] Gelernter, H., Realization of a Geometry Proving Machine, (Proc. of the International Conference on Information Processing (1959)), Reprinted in [11] · Zbl 0114.06901
[13] Michie, D., Strategy Building with the Graph Transver, (Collins, N. L.; Michie, D., Machine Intelligence, 1 (1967), Oliver and Boyd: Oliver and Boyd Edinburgh), 135-152
[14] Samuel, A., Some Studies in Machine Learning Using the Game of Checkers, IBM J., 3, 211-229 (1959), Reprinted in [11]
[15] Samuel, A., Some Studies in Machine Learning Using the Game of Checkers II. Recent Progress, IBM J. of Research and Development, 11, No. 6, 601-617 (1967)
[16] Sandewell, E. J., A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees, J. ACM, 16, No. 3, 364-382 (July 1969)
[17] Slagle, J.R. A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus. Reprinted in [11].; Slagle, J.R. A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus. Reprinted in [11]. · Zbl 0113.32801
[18] Slagle, J. R., A Multipurpose Theorem-Proving, Heuristic Program that Learns, (Proc. of the IFIP Congress (1965)) · Zbl 0173.01704
[19] Slagle, J. R.; Dixon, J. K., Experiments with Some Programs that Search Game Trees, J. ACM, 16, No. 2, 189-207 (April 1969)
[20] Hart, P. E.; Nilsson, N. J.; Raphael, B., A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Trans. or System Sciences and Cybernetics, Vol. SSC-4, No. 2, 100-107 (July 1968)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.