State-space approach in problem-solving optimization

  • Alberto Sangiovanni Vincentelli
  • Marco Somalvico
Computer And Communication Networks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4)


In this paper we have proposed a new description of SSPS, called syntactic description, which constitutes a framework useful to structure a rich content of informations about a given problem.

The semantic description has been shown to be equivalent to the syntactic description of SSPS.

A method has been briefly outlined, which is based on the semantic description, and which makes possible to extract, in an automatic way, i. e., by computation, the heuristic information useful to guide the search in the state space.

The future research work shall be addressed to the exploitation of the semantic description as a powerful basis on which to formulate procedures apted to solve the main goal of automatic problem-solving.

In particular the direction of heuristic guided search and learning will be investigated.


Optimum Cost Problem Representation Semantic Description Semantic Domain Heuristic Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Feigenbaum, E., and Feldman, J. (eds). Computers and Thought. Mc Graw-Hill Book Company, New York, 1963.Google Scholar
  2. Minsky, M. (ed). Semantic Information Processing. The M.I.T. Press, Cambridge, Massachusetts, 1968.Google Scholar
  3. Nilsson, N. Problem-Solving Methods in Artificial Intelligence. Mc Graw-Hill Book Company, New York, 1971.Google Scholar
  4. Slagle, J. Artificial Intelligence: the Heuristic Programming Approach. Mc Graw-Hill Book Company, New York, 1971.Google Scholar
  5. Amarel, S. On Representations of Problems on Reasoning about Actions. Michie, D. (ed.) Machine Intelligence 3, pp. 131–171. American Elsevier Publishing Company, Inc., New York, 1968.Google Scholar
  6. Hart, P., Nilsson, N., and Raphael, B. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. Sys.Sci. Cybernetics, vol. SSC-4, no.2, pp. 100–107, July 1968.Google Scholar
  7. Mandrioli, D., Sangiovanni Vincentelli, A., and Somalvico, M. Towards a Theory of Problem-Solving. Marzollo, A. (ed). Topics on Artificial Intelligence. Springer-Verlag New York, Inc., New York, 1973.Google Scholar
  8. Sangiovanni Vincentelli, A., and Somalvico, M. Theoretical Formalisation of the State-Space Method for Automatic Problem Solving. (In Italian). MP-AI Project. MEMO MP-AIM-6, October 1972.Google Scholar
  9. Sangiovanni Vincentelli, A., and Somalvico, M. Theoretical Aspects of State-Space Approach to Problem-Solving. Proc. VII International Congress on Cybernetics, Namur, September 1973 (a).Google Scholar
  10. Sangiovanni Vincentelli, A., and Somalvico M. Problem-Solving Methods in Computer-Aided Medical Diagnosis. Proc. XX International Scientific Conference on Electronics, Rome, March 1973 (b).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1973

Authors and Affiliations

  • Alberto Sangiovanni Vincentelli
    • 1
  • Marco Somalvico
    • 1
  1. 1.Milan Polytechnic Artificial Intelligence Project Istituto di Elettrotecnica ed ElettronicaPolitecnico di MilanoMilanItaly

Personalised recommendations