Inductive completion for transformation of equational specifications

  • Steffen Lange
  • Klaus P. Jantke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 534)

Abstract

The Knuth-Bendix completion procedure is a tool for algorithmically completing term rewriting systems which are operationally incomplete in the sense that the uniqueness of normal forms is not guaranteed. As the problem of operational completeness is undecidable, one may only expect a technique applicable to an enumerable number of cases. The Knuth-Bendix completion procedure may fail either by generating a critical pair which can not be oriented to form a new rewrite rule or by generating an infinite sequence of critical pairs to be introduced as new rewrite rules. The latter case is investigated. The basic idea is to invoke inductive inference techniques for abbreviating infinitely long sequences of rules by finitely many other rules. If simple syntactic generalization does not do, there will be automatically generated auxiliary operators. This is the key idea of the present paper. It contains a calculus of five learning rules for extending Knuth-Bendix completion procedures by inductive inference techniques. These rules are shown to be correct. The problem of completeness remains open.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AnSm]
    D. Angluin and C.H. Smith Inductive Inference: Theory and Methods, Computing Surveys 15 (1983) 3, 237–269CrossRefGoogle Scholar
  2. [EhMa]
    H. Ehrig and B. Mahr Fundamentals of Algebraic Specifications 1, EATCS Monographs on Theoretical Computer Science 6, Springer-Verlag, 1985Google Scholar
  3. [Herm]
    M. Hermann Chain Properties of Rule Closures, in: Proc. 6th STACS, B. Monien and R. Cori (eds.), Paderborn, 1989, Springer-Verlag, Lecture Notes in Computer Science 349, 1989, 339–347Google Scholar
  4. [HuOp]
    G. Huet and D. Oppen Equations and Rewrite Rules: A Survey, in: Formal Language Theory: Perspectives and Open Problems, R. Book (ed.), Academic Press, New York, 1980, 349–405Google Scholar
  5. [KaNa]
    D. Kapur and P. Narendran A Finite Thue System with Decidable Word Problem and Without Equivalent Finite Canonical System, Theor. Comp. Sci. 35 (1985) 2&3, 337–344Google Scholar
  6. [KnBe]
    D.E. Knuth and P.B. Bendix Simple Word Problems in Universal Algebra, in: Computational Algebra, J. Leach (ed.), Pergamon Press, 1970, 263–297Google Scholar
  7. [Lang]
    St. Lange Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion, in: Analogical and Inductive Inference, AII'89, Proc., K.P. Jantke (ed.), Springer-Verlag, Lecture Notes in Artificial Intelligence 397, 1989, 304–316Google Scholar
  8. [ThJa]
    M. Thomas and K.P. Jantke Inductive Inference for Solving Divergence in Knuth-Bendix Completion, in: Analogical and Inductive Inference, AII'89, Proc., K.P. Jantke (ed.), Springer-Verlag, Lecture Notes in Artificial Intelligence 397, 1989, 288–303Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Steffen Lange
    • 1
  • Klaus P. Jantke
    • 1
  1. 1.FB Mathematik & InformatikTechnische Hochschule LeipzigLeipzig

Personalised recommendations