Skip to main content
SpringerLink
Log in

An approach to the classification and comparison of methods of solution search in transformation problems

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. E. Sandewall, “Concepts and methods for heuristic search,” in: Proceedings of the International Joint Conference on Artificial Intelligence, Washington (1969).

  2. E. A. Feigenbaum and J. Feldman (editors), Computers and Thought, McGraw-Hill, New York (1963).

    Google Scholar 

  3. C. Green, “Application of theorem proving to problem solving,” in: Proceedings of the International Joint Conference on Artificial Intelligence, Washington (1969).

  4. J. Slagle and P. Bursky, “Experiments with a multipurpose theorem-proving heuristic program,” J. ACM,15 (January, 1968).

  5. J. Quinlan and E. Hunt, “A formal deductive problem-solving system,” J. ACM,15 (October, 1968).

  6. E. Sandewall, “A planning problem solver based on look-ahead in stochastic game trees,” J. ACM,16 (July, 1969).

  7. J. Doran and D. Michie, “Experiments with the graph traverser program,” Proc. Roy. Soc. (A),294 (1966).

  8. T. Nagata, M. Gamazaki, and M. Tsukamoto, “Robot planning system based on problem solver,” in: Proceedings of the International Joint Conference on Artificial Intelligence (1973).

  9. G. D. Gibbons, “POPS: an application of heuristic search methods to the processing of a nondeterministic programming language,” in: Proceedings of the International Joint Conference on Artificial Intelligence, Washington (1969).

  10. R. Fikes and N. Nilsson, “STRIPS: a new approach to the application of theorem proving to problem solving,” Artificial Intelligence,3, No. 4 (1971).

    Google Scholar 

  11. E. Sacerdoty, “Planning in a hierarchy of abstraction spaces,” in: Proceedings of the International Joint Conference on Artificial Intelligence (1973).

  12. L. Siklossy and J. Dreussi, “An efficient robot planner which generates its own procedures,” in: Proceedings of the International Joint Conference on Artificial Intelligence (1973).

  13. V. P. Gladun, N. I. Galagan, and S. M. Sasina, “On a strategy for solution search in transformation problems,” Kibernetika, No. 5 (1974).

  14. J. Pohl, “Bi-directional search,” in: Machine Intelligence, Vol. 6, Edinburgh (1971).

  15. A. Newell, J. Shaw, and H. Simon, “Report on a general problem-solving program,” in: Proceedings of the International Conference on Information Processing, Paris, UNESCO Hause (1959).

Download references

Authors
  1. V. P. Gladun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. I. Galagan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 131–133, July–August, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gladun, V.P., Galagan, N.I. An approach to the classification and comparison of methods of solution search in transformation problems. Cybern Syst Anal 12, 629–632 (1976). https://doi.org/10.1007/BF01070400

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070400

Keywords

Search

Navigation