Abstract
We present a new method for solving word problems using complexity functions. Complexity functions are used to compute normal forms. Given a set of (conditional) equations E, complexity functions are used to convert these equations into reductions (rewrite rules decreasing the complexity of terms). Using the top-down reduction extension Rep induced by a set of equations E and a compIexity function, we investigate properties which guarantee that any two (ground) terms t1 and t2 are congruent modulo the congruence ≌E if and only if Rep(t1)=Rep ( t2). Our method actually consists in computing Rep incrementally, as the composition of a sequence of top-down reduction extensions induced by possibly different complexity functions. This method relaxes some of the restrictions imposed by the Cburch-Rosser property.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Book, R., Confluent and other Types of Thue Systems, JACM 29 (1982), 171–182.
Brand, D., Darringer, J., and Joyner, W., Completeness of Conditional Reductions, IBM Technical Report RC-7404 (1978), T.J. Watson Research Center, Yorktown Heights, N.Y.
Dershowitz, N., Orderlngs for Term-Rewriting Systems, Theoretical Computer Science 17 (1982), 279–301.
Gallier, J,H. and Book, R.V., Reductions in Tree-Rewriting Systems, to appear in Theoretical Comput er Sci ence (1984).
Huet, G., Confluent Reductions: Abstract Properties and Applications to Term-Rewriting Systems, JACM 27(4) (1980), 797–821.
Huet, G. and Oppen, D., Equations and Rewrite Ru]es, in Formal Languages: Perspec tives and Open Problems, R.V. Book, Ed., Academic Press (1980), 349–405.
Knuth, D. and Bendix, P., Simple Word Problems in Universal Algebras, In Computational Problems in Abst ract Algebra, Leach J., Ed., Pergamon Press (1970), 263–297.
Lankford, D.S. and Ballantyne, A.M., Decision Procedures for Simple Equational Theories with Permutative Axioms: Complete Sets of Permutative Reductions, Report ATP-37, Department of Mathematics and Computer Science, University of Texas, Austin, Texas (1977).
Pelin A. and Gallier, J.H., Comput ing Normal Forms Using Complexity Functions over Nk, in preparation.
Plaisted, D., Well-Founded Orderings for Proving Termination of Systems of Rewrite Rules, Report R-78-932, Department of Computer Science, University of Illinois, Urbana, Ill. (1978).
Siekman, J. and Szabo, P., Universal Unification and Regular Equational ACFM Theories, Technical Report, University of Karlsruhe (1981).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pelin, A., Gallier, J.H. (1984). Solving Word Problems in Free Algebras Using Complexity Functions. In: Shostak, R.E. (eds) 7th International Conference on Automated Deduction. CADE 1984. Lecture Notes in Computer Science, vol 170. Springer, New York, NY. https://doi.org/10.1007/978-0-387-34768-4_28
Download citation
DOI: https://doi.org/10.1007/978-0-387-34768-4_28
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96022-7
Online ISBN: 978-0-387-34768-4
eBook Packages: Springer Book Archive