Search and causal analysis

  • Louis F. Pau
  • Claudio Gianotti


In Chapter 3 the idea was introduced of representing knowledge as symbolic structures, and knowledge manipulation (i.e.reasoning) as formal symbolic manipulation. We also stressed how each knowledge representation formalism limits the set of allowable symbolic structures and manipulations, thus enforcing a consistent abstraction of the real world and/or achieving useful properties. In this chapter we deal with search, i.e. the general problem of finding a sequence of allowable symbolic manipulations transforming a set of given structures into another target set. Examples of target sets are:
  • goals to be fulfilled

  • hypotheses or pre-conditions to be found

  • hypotheses to be evaluated

  • explanations


Goal Node Search Procedure Causal Analysis Solution Path Heuristic Function 
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.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1990

Authors and Affiliations

  • Louis F. Pau
    • 1
  • Claudio Gianotti
    • 2
  1. 1.Technical University of DenmarkLyngbyDenmark
  2. 2.MilanoItaly

Personalised recommendations