Rewrite Rules

Alias: condition-action pairs, demodulants
  • Alan Bundy
  • Lincoln Wallen
Part of the Symbolic Computation book series (SYMBOLIC)


Rewrite rules are sets of ordered pairs of expressions (lhs,rhs) usually depicted as (lns ⇒ rhs). There is usually a similarity relation between the “lhs” and the “rhs” such as equality, inequality or double implication. Rewrite rules, as the pairs are called, together with the rewriting rule of inference allow one expression to be “rewritten” into another. A subexpression of the initial expression is matched with the “lhs” of the rewrite rule yielding a substitution. The resulting expression is the expression obtained by replacing the distinguished subexpression with the “rhs” of the rewrite rule after applying the substitution.


Expert System Procedure Call Automatic Theorem Prove Abstract Data Type Remote Procedure Call 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Huet & Oppen 80]
    Huet, G. and Oppen, D.C. Equations and Rewrite Rules: A Survey. Technical Report CSL-111. SRI international. January. 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Alan Bundy
    • 1
  • Lincoln Wallen
  1. 1.Department of Artificial IntelligenceEdinburgh UniversityEdinburghScotland

Personalised recommendations