It is shown that, for some intersection and implication functions, an exact and efficient algorithm exists for the computation of inference results in multiconditional approximate reasoning on domains which are finite intervals of the real numbers, when membership functions are restricted to functions which are continuous and piecewise linear. An implementation of the algorithm is given in the functional programming language Miranda.
|Number of pages||8|
|Publication status||Published - Aug 1999|
|Event||Computational Intelligence for Modelling, Control & Automation, CIMCA 1999 - Vienna, Austria|
Duration: 17 Feb 1999 → 19 Feb 1999
|Conference||Computational Intelligence for Modelling, Control & Automation, CIMCA 1999|
|Period||17/02/99 → 19/02/99|
|Other||17-19 February 1999|