Mechanisms

A list of some mechanisms found in 20NAR1 or planned or in other implementations.
All organized by responsibility (where is it used)

mechanism name	responsibility	description
Anticipation	procedural	Anticipation is a mechanism to collect negativeevidence for procedural knowledge
Motor babbling	procedural	the agent has to be able to gather information on what happens when it is invoking operators when a given precondition is observed. This is done with motor babbling, which is a mechanism which picks a random operator after a precondition was observed. The effects are recorded and may be used for realizing particular matching goals
Decision making	procedural	decision making is realized with the decision rule. The decision is made by calling the op of the seq if the expectation is above the decision threshold
Predictive decision making	procedural	Predictive decision making is decision making which is invoked when doing a prediction which ”hits” a(derived) goal. Checking for a hit of a derived goal may be implemented with a hashtable lookup. It is currently implemented with a scan of a table of all goals to keep the complexity of the implementation down.
Adaptive compute resource scheduler	attention	A big problem in any design according to AIKR is how to distribute resources (which can be CPU cycles or memory) among the different processes. One requirement is that the time of a reasoning cycle is not longer than a given (soft) limit. This corresponds to a system working in real-time with a given interactivity (a system which finishes a cycle is more responsive and thus more interactive). \newline A adaptive scheme is used in the latest published version of 20NAR1. A scheduler has a time quota (which is similar to the quota as described for EURISKO\cite{lenat1983eurisko}) which can be "filled up" till the end of the cycle. This is implemented with a arg max utility based decision procedure where the utility measures how urgent a given compute procedure is. Ending the cycle is always given a utility of 1.0. The utility functions of the procedures to select take the reaming time of the cycle into account. A advantage of this mechanism is that the selection of the internal action is not predetermined by the program.