Abstract
E-unification (i.e. solving equations modulo an equational theory E) is an essential technique in automated reasoning, functional logic programming and symbolic constraint solving but, in general E-unification is undecidable. In this paper, we focus on R-unification (i.e. E-unification where theories E are presented by term rewriting systems R). We propose a general method based on tree tuple languages which allows one to decide if two terms are unifiable modulo a term rewriting system R and to represent the set of solutions. As an application, we prove a new decidability result using primal grammars.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proceedings 21st ACM Symposium on Principle of Programming Languages, Portland, pages 268–279, 1994.
F. Baader and J. Siekmann. Unification Theory. In D.M. Gabbay, C.J. Hogger, and Robinson J.A., editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, Oxford, UK, 1993.
A. Bockmayr, S. Krischer, and A. Werner. Narrowing strategies for arbitrary canonical systems. Fundamenta Informaticae, 24(1,2):125–155, 1995.
H. Comon. On unification of terms with integer exponents. Math. Systems Theory, 28:67–88, 1995.
H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. 1997.
N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. Van Leuven, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990.
H. Faßbender and S. Maneth. A Strict Border for the Decidability of E-Unification for Recursive Functions. In proceedings of the intern. Conf. on Algebraic and Logic Programming., number 1139 in LNCS, pages 194–208. Springer-Verlag, 1996.
M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19 & 20:583–628, May/July 1994.
M. Hanus. A unified computation model for functional and logic programming. In Proc. 24st ACM Symposium on Principles of Programming Languages (POPL'97), pages 80–93, 1997.
M. Hermann and R. Galbavý. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, 176, 1997.
S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. Discrete Mathematics and Theoritical Computer Science (http://www.chapmanhall.com/dm), 1:69–98, 1997.
S. Limet and P. Réty. Solving Disequations modulo some Class of Rewrite System. In Proceedings of 9th Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 121–135. Springer-Verlag, 1998.
A. Middeldorp, S. Okui, and T. Ida. Lazy Narrowing: Strong Completeness and Eager Variable Elimination. In procedings of the 20th Colloquium on Trees in Algebra and Programming, LNCS, 1995.
S. Mitra. Semantic Unification for Convergent Rewrite Systems. Phd thesis, Univ. Illinois at Urbana-Champaign, 1994.
R. Caballero Rold n, P. L pez Fraguas, and S nchez Hern ndez J.. User's manual for toy. Technical Report 57-97, Departamento de Sistemas Inform ticos y Programaci n, Facultad de Matem ticas (UCM), Madrid, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Limet, S., Saubion, F. (1998). A general framework for R-unification problems. In: Palamidessi, C., Glaser, H., Meinke, K. (eds) Principles of Declarative Programming. ALP PLILP 1998 1998. Lecture Notes in Computer Science, vol 1490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056619
Download citation
DOI: https://doi.org/10.1007/BFb0056619
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65012-6
Online ISBN: 978-3-540-49766-0
eBook Packages: Springer Book Archive