Fuzzy reasoning with continuous piecewise linear membership functions

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.