Conditional rewrite rule systems with built-in arithmetic and induction

  • Sergey G. Vorobyov
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)


Conditional rewriting systems, conditions being the formulae of decidable theories, are investigated. A practical search space-free decision procedure for the related class of unquantified logical theories is described. The procedure is based on cooperating conditional reductions, case splittings and decision algorithms, and is able to perform certain forms of inductive inferences. Completeness and termination of the procedure are proved.


Decision Procedure Decision Algorithm Inductive Definition Case Splitting Term Rewrite System 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [Hs]
    Hsiang J. Refutational Theorem proving using term rewriting systems. — Artificial Intelligence, 1985, vol. 25, no.2, pp. 255–300.Google Scholar
  2. [HuHu]
    Huet G., Hullot J.M. Proofs by Induction in Equational Theories with Constructors. — Proc. 21st Symp. on Foundations of Computer Science, 1980, pp. 96–107.Google Scholar
  3. [BuOp]
    Huet G., Oppen D.C. Equations and Rewrite Rules: A Survey. — In: Formal Language Theory: Perspectives and Open Problems. — New-York, Academic Press, 1980, pp. 349–406.Google Scholar
  4. [Jo]
    Jouannaud J.-P. Confluent and Coherent Equational Term Rewriting Systems: Applications to Proofs in Abstract Data Types. — Lecture Notes in Computer Science, 1983, vol. 159, pp. 256–283.Google Scholar
  5. [JoKo]
    Jouannaud J.P., Kounalis E. Automatic Proofs by Induction in Equational Theories Without Constructors. — Proc. Symp. "Logic in Computer Science", 1986, pp. 358–366.Google Scholar
  6. [Ka]
    Kaplan S. Conditional Rewrite Rules. — Theoretical Computer Science, 1984, vol. 33, no. 2–3, pp. 175–193.Google Scholar
  7. [KB]
    Knuth D.E., Bendix P.B. Simple Word Problems in Universal Algebras. — In: Computational Problems in Universal Algebras. — Pergamon Press, 1970, pp. 263–297.Google Scholar
  8. [Ra]
    Rabin M.O. Decidability of second-order theories and automata on infinite trees. — Transactions of the American Mathematical Society, 1969, vol.141, no.7, pp.1–35.Google Scholar
  9. [Sh1]
    Shostak R.E. On the SUP-INF Method for Proving Presburger Formulas. — Journal of the ACM, 1977, vol. 24, no. 4, pp. 529–543.Google Scholar
  10. [Sh2]
    Shostak R.E. A Practical Decision Procedure for Arithmetic with Function Symbols. — Journal of the ACM, 1979, vol.26, no. 2, pp. 351–360.Google Scholar
  11. [Vol]
    Vorobyov S.G. On the Arithmetic Inexpressiveness of Term Rewriting Systems. — Proc. 3rd Symp. "Logic in Computer Science", 1988, pp. 212–217.Google Scholar
  12. [Vo2]
    Vorobyov S.G. On the Use of Conditional Term Rewriting Systems in Program Verification. — Programmirovanie, 1986, no. 4, pp. 3–14 (in Russian).Google Scholar
  13. [Vo3]
    Vorobyov S.G. Applying Conditional Term Rewriting Systems in: Automated Theorem Proving. — Izvestija Akademii Nauk SSSR, Technicheskaya Kibernetika, 1988, N 5, pp. 25–39 (in Russian).Google Scholar
  14. [Vo4]
    Vorobyov S.G. On the Completion of Conditional Rewrite Rule Systems with Built-in Decision Algorithms. — In: Theory and Methods of Parallel Information Processing. — Novosibirsk, Computer Center, 1988, pp. 131–146 (in Russian).Google Scholar
  15. [Vo5]
    Vorobyov S.G. A Structural Completeness Theorem for a Class of Conditional Rewrite Rule Systems. — Proc. Conf. on Computer Logic, COLOG'88, Vol. 2, pp. 194–208, Tallinn, Estonia, 1988 (to appear in Journal of Symbolic Computation).Google Scholar
  16. [Vo6]
    Vorobyov S.G. The quantifier-free theory of partial order cannot be axiomatized by a canonical rewrite rule system. — Submitted to "Foundations of Computational Theory '89"Google Scholar
  17. [ZRe]
    Zhang H., Remy J.-L. Contextual Rewriting. — Lecture Notes in Computer Science, 1985, vol. 202, pp. 46–62.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Sergey G. Vorobyov
    • 1
  1. 1.Program Systems InstituteUSSR Academy of SciencesPereslavl-ZalesskySoviet Union

Personalised recommendations