An algorithm for identification of relations among rules

A representation of a rule-based system is proposed. It is used to define relations among rules. The relations defined are cause-effect, mutual exclusion, redundancy, conflict, subsumption, and implication. A relation between two rules is either complete, i.e. the relation holds for all instantiations of the rules, or partial, i.e. the relation holds only for some instantiations of the rules. An algorithm for detecting relations between a new rule (to be added to the rule base) and rules in the rule base is developed. The algorithm is applicable to any forward chaining rule-based system. Application of this algorithm during rule base modification would identify possible problems resulting from the modification. The algorithm is implemented on a MicroVAX computer using C language. Examples of its application to a rule-based system are shown