Chain properties of rule closures-Reference-Cited by-同舟云学术

Chain properties of rule closures

Published:1990-03 Issue:1 Volume:2 Page:207-225
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Hermann Miki¹

Affiliation:

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

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01888225.pdf

Reference18 articles.

1. Termination of rewriting systems by polynomial interpretations and its implementation

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. Termination of rewriting

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.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Forward Closure and the Finite Variant Property;Frontiers of Combining Systems;2013

2. Formalising a Value-Passing Calculus in HOL;Formal Aspects of Computing;1999-09

3. Basics of Term Rewriting;Handbook of Formal Languages;1997

4. Rewriting properties of combinators for rudimentary linear logic;Higher-Order Algebra, Logic, and Term Rewriting;1994

5. Solving divergence in Knuth-Bendix completion by enriching signatures;Theoretical Computer Science;1993-04