Основы построения и функционирования интеллектуальных информационных систем. Былкин В.Д - 202 стр.

UptoLike

ВУЗ: 

ПГУ | Пенза

Составители: 

Рубрика: 

202
Продолжение прил.
BEGIN
solved :=FALSE;
curr_object:. sought: =TRUE;
curr_rule :=find_rule(f_object ,top_rule );
WHILE ((curr_rule<>NIL) AND (ok_add(f_object,DEFINITE)=TRUE)) DO BEGIN
curr_prem: = curr_rule^.prem;
bad:=FALSE;
lowest:=DEFINITE;
WHILE ((curr_prem<>NIL) AND (bad=FALSE)) DO
BEGIN
pursue ( curr_. objects );
curr_value: =test(curr_prem^.objects ,curr_prem^.value);
IF cur_value=NlL THEN bad:=TRUE
ELSE IF curr_value^.cert<lowest THEN
1оwest:=curr_value^. cert; curr_prem :=curr_prem^.next
END;
IF(bad=FALSE)THEN
BEGIN IF(explain=TRUE) THEN
explain_how(curr_rule);
conclude(curr_rule, lowest);
solved:=TRUE
END;
curr_rule:=find_rule ( f_object, curr_rule^. next)
END;
IF (solved=FALSE) THEN
BEGIN
IF(explain=TRUE) THEN explain_why(f_object);
ask( f_object, f_value);
add_object( f_object ,f_value);
add__cf (f_object, f_value .DEFINITE)
END
END
END; 
                                                                             Продолжение прил.
   BEGIN
solved :=FALSE;
curr_object:. sought: =TRUE;
curr_rule :=find_rule(f_object ,top_rule );
WHILE ((curr_rule<>NIL) AND (ok_add(f_object,DEFINITE)=TRUE)) DO BEGIN
          curr_prem: = curr_rule^.prem;
          bad:=FALSE;
           lowest:=DEFINITE;
          WHILE ((curr_prem<>NIL) AND (bad=FALSE)) DO
           BEGIN
               pursue ( curr_. objects );
                  curr_value: =test(curr_prem^.objects ,curr_prem^.value);
                  IF cur_value=NlL THEN bad:=TRUE
                  ELSE IF curr_value^.cert

Страницы