Abstract
In this paper a new approach to divergence in Knuth-Bendix completion is presented. Given a term rewriting system R, whose completion diverges, a strategy can be defined to simulate the application of the (infinitely many) rewrite rules derived from critical pairs, without attempting any completion. This is done by applying some of the rules in R also as expansion rules.
Research partially supported by Progetto Finalizzato Sistermi Informatici e Calcolo Parallelo of C.N.R., Italy.
Research supported by Consiglio Nazionale delle Ricerche (C.N.R.), Italy.
Chapter PDF
References
Avenhaus J., ‘Proving Equational and Inductive Theorems by Completion and Embedding Techniques', in Proceedings of Rewriting Techniques and Applications, Lecture Notes in Computer Science, Springer-Vorlag, 1991, Vol. 488, pp. 361–373.
Chen H., Hsiang J., Kong H. ‘On Finite Representations of Infinite Sequences of Terms', in Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal, 1990, Lecture Notes in Computer Science, Springer-Verlag, 1991, Vol. 516, pp. 100–114.
Dershowitz N., Jouannaud J.-P., ‘Rewrite Systems', in Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, J. van Leeuwen (ed.), North-Holland, 1990, pp. 243–320.
Gloess P.Y., Laurent J.-P. II., ‘Adding Dynamic Paramodulation to Rewrite Algorithms', in Proceedings of the 5th Conference on Automated Deduction, Lecture Notes in Computer Science, Springer-Verlag, 1980, Vol. S7, pp. 195–207.
Hermann M., ‘Vademecum of Divergent Term Rewriting Systems', Technical Report CRIN 88-R-082, Centre de Recherche en Informatique de Nancy, 1988.
Hermann M., ‘Crossed Term Rewriting Systems', Technical Report CRIN 89-R-003, Centre de Recherche en Informatique de Nancy, 1989.
Hermann M., ‘Chain Properties of Rule Closures', Formal Aspects of Computing, 1990, Vol. 2, pp. 207–225.
Inverardi P., Nesi M., ‘A Rewriting Strategy to Verify Observational Congruence', Information Processing Letters, 1990. Vol. 35, pp. 191–199.
Inverardi P., Nesi M., ‘On Rewriting Behavioural Semantics in Process Algebras', in Proceedings of the 2nd International Conference on Algebraic Methodology and Software Technology AMAST '91, Iowa City, USA, 1991, (to appear in Workshop Series, Springer-Verlag).
Inverardi P., Nesi M., ‘On Dealing with Divergent Rewrite Systems', Technical Report B4-06, I.E.I.-C.N.R., Pisa, Italy, March 1992.
Kirchner H., ‘Schematization of infinite sets of rewrite rules generated by divergent completion processes', in Theoretical Computer Science, North-Holland, 1989, Vol. 67, pp. 303–332.
Kirchner H., Hermann M., ‘Meta-rule Synthesis from Crossed Rewrite Systems', in Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal, 1990, Lecture Notes in Computer Science, Springer-Verlag, 1991, Vol. 516, pp. 143–154.
Knuth D., Bendix P., 'simple word problems in universal algebra', Computational Problems in Abstract Algebra, J. Leech (ed.), Pergamon Press, 1970.
Lange S., ‘Towards a Set of Inference Rules for Solving Divergence in Knuth-Bendix Completion', in Proceedings of Analogical and Inductive Inference, K.P. Jantke (ed.), Lecture Notes in Computer Science, Springer-Verlag, 1989, Vol. 397, pp. 304–316.
Lysne O., ‘Term Rewriting Techniques for Systems based on Generator Induction', Research Report No. 163, Department of Informatics, University of Oslo, December 1991.
Milner R., Communication and Concurrency, Prentice Hall, 1989.
Sattler-Klein A., ‘Divergence phenomena during completion', in Proceedings of Rewriting Techniques and Applications, Lecture Notes in Computer Science, Springer-Verlag, 1991, Vol. 488, pp. 374–385.
Thomas M., Jantke K. P., ‘Inductive Inference for Solving Divergence in Knuth-Bendix Completion', in Proceedings of Analogical and Inductive Inference, K.P. Jantke (ed.), Lecture Notes in Computer Science, Springer-Verlag, 1989, Vol. 397, pp. 288–303.
Thomas M., Watson P., ‘Solving Divergence in Knuth-Bendix Completion by Enriching Signatures', submitted to Theoretical Computer Science, abstract in Proceedings of the 2nd International Conference on Algebraic Methodology and Software Technology AMAST '91, Iowa City, USA, 1991, (to appeal-in Workshop Series, Springer-Verlag).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inverardi, P., Nesi, M. (1993). A strategy to deal with divergent rewrite systems. In: Rusinowitch, M., Rémy, JL. (eds) Conditional Term Rewriting Systems. CTRS 1992. Lecture Notes in Computer Science, vol 656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56393-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-56393-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56393-8
Online ISBN: 978-3-540-47549-1
eBook Packages: Springer Book Archive