Summary: According to the operation of decomposition (also known as representation theorem) [\textit{C. V. Negoita} and \textit{D. A. Ralescu}, Kybernetes 4, 169-174 (1975; Zbl 0352.02044)] in fuzzy set theory, the whole fuzziness of an object can be characterized by a sequence of local crisp properties of that object. Hence, any fuzzy reasoning could also be implemented by using a similar idea, i.e., a sequence of precise reasoning. More precisely, we could translate a fuzzy relation ``If \(A\) then \(B\)'' of the generalized modus ponens rule (the most common and widely used interpretation of a fuzzy rule, \(A\), \(B\), are fuzzy sets in a universe of discourse \(X\), and of discourse \(Y\), respectively) into a corresponding precise relation between a subset of \(P(X)\) and a subset of \(P(Y)\), and then extend this corresponding precise relation to two kinds of transformations between all \(L\)-type fuzzy subsets of \(X\) and those of \(Y\) by using Zadeh's extension principle, where \(L\) denotes a complete lattice. In this way, we provide an alternative approach to the existing compositional rule of inference, which performs fuzzy reasoning based on the extension principle. The approach does not depend on the choice of fuzzy implication operator nor on the choice of a t-norm. The detailed reasoning methods, applied in particular to the generalized modus ponens and the generalized modus tollens, are established and their properties are further investigated in this paper.