An Incremental Error Correcting Evaluation Algorithm For Recursion Networks without Circuits

  • Ingo Althöfer
Conference paper
Part of the Lecture Notes in Biomathematics book series (LNBM, volume 84)


A recursion network consists of a directed graph together with an evaluation function v on the set of nodes of the graph, such that the value of every nonterminal node recursively results from the values of its successors. An example is a game graph with a grundy-function. Consider the problem to determine the value of a specified node ‘root’, when instead of v only an erroneous estimation function \( \hat v\) on the set of all nodes is given. (Typically v and \( \hat v\) will coincide in many, but not in all nodes.)

This paper presents a simple algorithm which yields the correct value v (root), if on every longpath with starting node ‘root’ the estimates \( \hat v\) provide “more correct than wrong information” about the v-values. A longpath is a path that cannot be prolonged.


Directed Graph Rooted Tree Terminal Node Game Graph Wrong 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. 1.
    I. Althöfer, An incremental negamax algorithm, 1987.Google Scholar
  2. 2.
    R. Gellman, S. Dreyfus, “Applied Dynamic Programming”, Princeton University Press, Princeton (New Jersey), 1962.Google Scholar
  3. 3.
    J. H. van Lint, “Introduction to Coding Theory”, Springer, New York, 1982.zbMATHCrossRefGoogle Scholar
  4. 4.
    N.J. Nilsson, “Principles of Artificial Intelligence”, Tioga, Palo Alto (California ), 1980.zbMATHGoogle Scholar
  5. 5.
    J. Pearl, “Heuristics-Intelligent Search Strategies for Computer Problem Solving”, Addison-Wesley, Reading (Massachusetts ), 1985.Google Scholar
  6. 6.
    J. Pearl, Distributed revision of composite beliefs, Artificial Intelligence 33 (1987), 173–215.MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    W.W. Peterson, E.J. Weldon Jr., “Error Correcting Codes”, 2. ed., MIT Press, Cambridge (Massachusetts ), 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Ingo Althöfer
    • 1
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeld 1West Germany

Personalised recommendations