Detecting redundancy among production rules using term rewrite semantics
We present a general method for detecting wide classes of redundant production rules (PRs) based on the term rewrite semantics. We present the semantic account, define rule execution over both ground memories and memory schemas, and define redundancy for the PRs. From those definitions, an algorithm is developed that detects wide classes of redundant rules, and which improves upon the previously published methods.
redundancy term rewriting production rule systems validation and verification software engineering