Rule break up with compositional rule of inference

It is shown that complex rules can be broken up into simple rules when the rules are represented with any S-implication or any R-implication. It is emphasized that the Godel implication is the only meaningful implication function to be used with the max-min composition if the inferencing mechanism is to satisfy certain properties. It is also shown that the rule breakup with max-min composition and Godel implication provides a very efficient and meaningful inferencing mechanism.<
>