Skip to main content
SpringerLink
Log in

Chain properties of rule closures

  • Published:
Formal Aspects of Computing

Abstract

This article introduces a generalisation of the crossed rule approach to the detection of Knuth-Bendix completion procedure divergence. It introduces closure chains, which are special rule closures constructed by means of particular substitution operations and operators, as a suitable formalism for progress in this direction. Supporting substitution algebra is developed first, followed by considerations concerning rule closures in general, concluding with an investigation of closure chain properties. Issues concerning the narrowing process are not discussed here.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. BenCherifa, A. and Lescanne, P.: Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation.Science of Computer Programming, 9(2), 137–159 (1987).

    Article  Google Scholar 

  2. Dauchet, M.: Simulation of Turing Machines by a Left-Linear Rewrite Rule. In:Proc. 3rd Conf. Rewriting Techniques and Applications, Chapel Hill, (North Carolina, USA), N. Dershowitz (ed.), pp. 109–120, Lecture Notes in Computer Science 355, Springer-Verlag, 1989.

  3. Dershowitz, N.: Termination of Rewriting.Journal of Symbolic Computation, 3(1 & 2), 69–116 (1987). (Special issue on rewriting techniques and applications.)

    Google Scholar 

  4. Dershowitz, N. and Jouannaud, J.-P.: Notations for Rewriting, unpublished note, October 1989.

  5. Fay, M.: First-Order Unification in an Equational Theory. In:Proc. 4th Workshop on Automated Deduction, S. Sickel, (ed.), pp. 161–167, Austin, TX, February 1979.

  6. Guttag, J. V., Kapur, D. and Musser, D. R.: On Proving Uniform Termination and Restricted Termination of Rewrite Systems.SIAM Journal on Computation, 12(1), 189–214 (1983).

    Google Scholar 

  7. Hermann, M.: Crossed Term Rewriting Systems, Research report 89-R-003, Centre de Recherche en Informatique de Nancy, 1989. (Submitted for publication.)

  8. Hermann, M. and Prívara, I.: On Nontermination of Knuth-Bendix Algorithm, In:Proceedings 13th ICALP Conference, Rennes (France), L. Kott, (ed.), pp. 146–156, Lecture Notes in Computer Science 226. Springer-Verlag, 1986.

  9. Huet, G.: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm.Journal of Computer and System Science. 23(1), 11–21 (1981). (Also as: Rapport 25. INRIA, 1980).

    Google Scholar 

  10. Huet, G. and Lankford, D. S.: On the Uniform Halting Problem for Term Rewriting Systems. Rapport de recherche 283, Institute de Recherche en Informatique et en Automatique, Le Chesnay, France, 1978.

  11. Hullot, J.-M.: Canonical Forms and Unification. In:Proc. 5th Conf. on Automated Deduction, Les Arcs (France), W. Bibel and R. Kowalski (eds), Lecture Notes in Computer Science 87, pp. 318–334, Springer-Verlag, New York, 1980.

    Google Scholar 

  12. Kirchner, H.: Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Process.Theoretical Computer Science, 67(2-3), 303–332 (1989).

    Google Scholar 

  13. Lankford, D. S.:Canonical Inference, Research report ATP-32. Department of Mathematics and Computer Science, University of Texas, Austin, TX, December 1975.

    Google Scholar 

  14. Lankford, D. S. and Musser, D. R.: A Finite Termination Criterion, Unpublished draft, Information Sciences Institute, University of Southern California, Marina-del-Rey, CA, 1978.

    Google Scholar 

  15. Lescanne, P.: Computer Experiments with the REVE Term Rewriting System Generator. InProc. 10th ACM POPL Symp., Austin, TX, pp. 99–108, 1983.

  16. Narendran, P. and Stillman, J.: It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair. InProc. 6th STAGS, Paderborn (FRG), B. Monien and R. Cori, (eds), pp. 348–359. Lecture Notes in Computer Science, 349, Springer-Verlag, 1989.

  17. Rosen, B. K.: Tree-Manipulating Systems and Church-Rosser Theorems.Journal of ACM, 20(1), 160–187 (1973).

    Google Scholar 

  18. Slagle, J. R.: Automated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity.Journal of ACM, 21, 662–642 (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de Recherche en Informatique de Nancy, CNRS and INRIA-Lorraine, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy, France

    Miki Hermann

Authors
  1. Miki Hermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hermann, M. Chain properties of rule closures. Formal Aspects of Computing 2, 207–225 (1990). https://doi.org/10.1007/BF01888225

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01888225

Key words

Search

Navigation