It is shown that, for some intersection and implication functions, the complexity of the computation of inference results with generalised modus ponens can be reduced considerably when membership functions are restricted to functions which are continuous and piecewise linear. Algorithms for computing inference results are given in the functional language Miranda.
|Title of host publication||Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS)|
|Editors||C. Isik, V. Cross|
|Place of Publication||Syracuse, USA|
|Publisher||North American Fuzzy Information Processing Society|
|Number of pages||6|
|Publication status||Published - Sep 1997|
van den Broek, P. M. (1997). Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions. In C. Isik, & V. Cross (Eds.), Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) (pp. 371-376). Syracuse, USA: North American Fuzzy Information Processing Society. https://doi.org/10.1109/NAFIPS.1997.624069