A method for processing fuzzy inferences and corresponding processing structure
    1.
    发明公开
    A method for processing fuzzy inferences and corresponding processing structure 审中-公开
    Fuzzy Inferenzverfahren und entsprechende Verarbeitungsstruktur

    公开(公告)号:EP1124199A1

    公开(公告)日:2001-08-16

    申请号:EP00830082.4

    申请日:2000-02-08

    CPC classification number: G06N7/04

    Abstract: For encoded membership functions used to identify the atomic conditions defining the antecedents of fuzzy inferences, and also for the determination of the operands of the said antecedents, corresponding stores (6, 9) are configured for the storage of the already available values of these encoded membership functions and of the said operands. At the time of identification of a new value for the said quantities, a check is made (5, 7) to see whether this value is already present in the corresponding store (6, 9). If the outcome of this check is positive, in the case of encoded membership functions, the mechanism by which the encoded fuzzy inferences point to these functions is changed, so that the pointers of the encoded fuzzy inferences are redirected towards the membership functions which are already stored. In the case of the operands of the antecedents, the check of the corresponding back-up store (9) is carried out preferably on the basis of the corresponding calculation values, the calculation of a new operand being disabled when it is found that the corresponding calculation parameters are already present in the corresponding back-up store (9). The aforesaid store (9) is preferably configured as a stack to which new calculated operand values are written at the uppermost position, with the possibility of making values identified as already present shift back to this uppermost position.

    Abstract translation: 对于用于识别限定模糊推理的前提的原子条件的编码的隶属函数,以及用于确定所述前提的操作数,对应的存储(6,9)被配置用于存储这些编码的已经可用的值 隶属函数和所述操作数。 在识别所述数量的新值时,进行检查(5,7)以查看该值是否已经存在于相应的存储器中(6,9)。 如果该检查的结果是肯定的,则在编码的隶属函数的情况下,编码的模糊推理指向这些函数的机制被改变,使得编码的模糊推理的指针被重定向到已经存在的隶属函数 存储。 在前提的操作数的情况下,最好根据对应的计算值对相应的备用存储(9)进行检查,当操作数的计算被发现为相应的 计算参数已经存在于相应的备用存储(9)中。 上述存储器(9)优选地被配置为在最上位置写入新的计算的操作数值的堆栈,使得被识别为已经存在的值可能返回到该最高位置的可能性。

Patent Agency Ranking