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

Procedure create-tree (facts, fuzzy-belief);
Begin
create root of the data-tree;
open the datafile, i.e., the file containing the database;
Repeat
i) Read a fact from the datafile; //after reading, the file pointer increases//
ii) If the corresponding predicate is found at the second level of
the data-tree, Then mark the node Else create a new node at the
second level to represent the predicate and mark it;
iii) Search the fact among the children of the marked predicate;
iv) If the fact is not found, Then include it at the third level
as a child of the marked predicate
Until end-of-datafile is reached;
Close the datafile;
End.
Root
sustains-injury (X)
abbreviated si(X)
{si(ram), 0.9} {si(shyam), 0.8} {m(ram,jadu),0.8} {m(lata,asha), 0.6}{m(sita,ram), 0.6} {ha(ram), 0.6}
Fig. 23.8: The data-tree representation of the database.
23.5.3 The Knowledge Base
Murdered (X,Y)
abbreviated m(X,Y)
Has alibi (X)
abbreviated ha(X)
The KB of the proposed ES comprises of a set of default rules (DR) [1], a
set of production rules (PR) and two working memory (WM) modules. DR
are used to guess about the suspects. The typical structure [1], [4] of the DR
is as follows: