Intelligent Problem Solvers in Education: Design Method and Applications - Intelligent Systems - page 131

Definitions of special relations:

isa ::= ISA: name <, name>*;

hasa ::= HASA: [fact-def]

Definitions of facts:

facts ::= FACT : fact-def+

fact-def ::= object-type | attribute | name | equation | relation | expression

object-type ::= cobject-type ( name ) | cobject-type ( name <, name>* )

relation ::= relation ( name <, name>+ )

Definitions of relations based on facts:

relation-def ::= RELATION name;

ARGUMENT : argument-def+

[facts]

ENDRELATION ;

argument-def ::= name <, name>*: type;

Definitions of functions - form 1:

function-def ::= FUNCTION name;

ARGUMENT : argument-def+

RETURN : return-def;

[constraint]

[facts]

ENDFUNCTION ;

return-def ::= name: type;

Definitions of functions - form 2:

function-def ::= FUNCTION name;

ARGUMENT : argument-def+

RETURN : return-def;

[constraint]

[variables]

[statements]

ENDFUNCTION ;

statements ::= statement-def+

statement-def ::= assign-stmt | if-stmt | for-stmt

asign-stmt ::= name := expr;

if-stmt ::= IF logic-expr THEN statements+ ENDIF ; |

IF logic-expr THEN statements+ ELSE statements+ ENDIF ;

for-stmt ::= FOR name IN [ range ] DO statements+ ENDFOR ;

3.2 Computational networks
In this section, we present the models computational networks with simple valued variables
and networks of computational objects. They have been used to represent knowledge in
many domains of knowledge. The methods and techniques for solving the problems on the
networks will be useful tool for design intelligent systems, especially IPSE.