Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

procedure, however, no attempts have been taken to prevent the generation of
absurd clauses to keep the algorithm simple.
Procedure variable-instantiation-of-PRs (PRs, suspect, personmurdered);
Begin
For i := 1 to no-of-PRs do
Begin
Pick up the PR (X1, X2, ...., Xm );
Form new PRs by instantiating X1, X2, ...,Xm by elements from the set of
suspects and the person murdered such that X1 ≠ X2 ≠ … ≠Xm ;
Record these resulting rules in a list;
End For;
End.
Once the instantiation of the variables in the production rules is over
based on the procedure presented above, the facts of the resulting rules
are searched in the static database, represented in the form of a datatree.
A working memory WM1 keeps track of the instantiated clauses of
production rules, after these are detected in the data-tree. Moreover, if all the
AND clauses of a PR are found in the data-tree, the rule is fired and the
consequence of the PR is also recorded in the WM1. The information stored
in WM1 is subsequently used for the encoding of the place-transition pairs (of
FPN), corresponding to the PR. The WM1 is then cleared for future storage.
23.5.4 The Inference Engine
The inference engine (IE) of the said ES comprises of five modules, namely,
i) the module for searching the antecedents of PRs on the data-tree, ii) the
FPN formation module, iii) belief-revision and limit-cycle detection &
elimination module, iv) non-monotonic reasoning module, and v) decision
making [19] and explanation tracing module.
Searching antecedents of PR in the datatree: The following procedure
describes the technique for searching the instantiated clauses of a PR in a
data-tree.
Procedure search-on-data-tree (data-tree, key-data);
//searches the antecedents of PRs on data-tree//
Begin
Search the predicate corresponding to the key-clause in the
second level of the data-tree; If search is successful Then do
Begin
Search the key-clause among the children of the predicate under
consideration;