06.03.2013 Views

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

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

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

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

SR (Y, X) OR (M (X) ∧ M (Y) ∧ L (X, w (Y)))<br />

DR1: --------------------------------------------------------<br />

S (Y, murderer-of(X))<br />

which means that if (Y had strained relations with X ) or ((X <strong>and</strong> Y are<br />

males) <strong>and</strong> ( X loves wife of Y)) then unless proved otherwise, (suspect Y<br />

as the murderer of X).<br />

The variables X, Y, etc. of a predicate are instantiated by users through<br />

a query language. A working memory WM2 in the proposed system [8] is<br />

used to hold all the instantiated antecedents of a default rule. If all the<br />

instantiated antecedents of a rule are consistent, then the rule is fired <strong>and</strong><br />

the values bound to Y for the predicate suspect (Y, murderer-of (X)) are<br />

recorded. These values of Y together with a particular value of X (=x say) are<br />

used subsequently as the space of instantiation for each variable under each<br />

PR.<br />

The list of suspects, guessed by the DR, is also used at a subsequent<br />

stage for identifying the suspect-nodes of the FPN. The process of collecting<br />

data from users through query language <strong>and</strong> representation of those data in<br />

the form of a tree, called default-data-tree, can be best described by the<br />

following procedure.<br />

Procedure default-data-tree formation (no-of-predicates);<br />

//no-of-predicates denotes number of predicates<br />

in the entire set of default rules//<br />

Begin<br />

Create root-node;<br />

i:= 1;<br />

While i ≤ no-of-predicates do<br />

Begin<br />

writeln “Does predicate pi (X,Y) exist ?” ;<br />

readln (reply);<br />

If reply = no Then do<br />

Begin<br />

Create a predicate pi (X, Y) at the second level<br />

under the root;<br />

Repeat<br />

writeln “predicate pi (X,Y), X = ? ,Y = ?” ;<br />

readln (X, Y);<br />

If (X ≠ null ) <strong>and</strong> (Y ≠ null) Then<br />

Create a data node with the read values of X <strong>and</strong> Y<br />

under the predicate pi ;<br />

Until (X = null ) <strong>and</strong> ( Y = null)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!