Abstract.
The paper contains a proof of completeness of a goal-directed inference system for general E-unification with eager Variable Elimination. The proof is based on a careful analysis of a concept of ground, equational proof. The theory of equational proofs is developed in the first part. Solving variables in a goal is then shown to be reflected in defined transformations of an equational proof. The termination of these transformations proves termination of inferences with eager Variable Elimination.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Nipkow, T.: Term Rewriting and All That, Cambridge (1998)
Gallier, J., Snyder, W.: A general complete E-unification procedure. In: Lescanne, P. (ed.) RTA 1987. LNCS, vol. 256, pp. 216–227. Springer, Heidelberg (1987)
Gallier, J., Snyder, W.: Complete sets of transformations for general E-unification. In: TCS, vol. 67, pp. 203–260 (1989)
Hölldobler, S.: Foundations of Equational Logic Programming. LNCS (LNAI), vol. 353. Springer, Heidelberg (1989)
Kirchner, C., Kirchner, H.: Rewriting, Solving, Proving (2000), http://www.loria.fr/~ckirchne/
Martelli, A., Moiso, C., Rossi, G.F.: Lazy Unification Algorithms for Canonical Rewrite Systems. In: Aït- Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures. Rewriting Techniques, vol. II, pp. 258–282. Academic Press, London (1989)
Martelli, A., Rossi, G.F., Moiso, C.: An Algorithm for Unification in Equational Theories. In: Proc. 1986 Symposium on Logic Programming, pp. 180–186 (1986)
Morawska, B.: Completeness of E-unification with eager Variable Elimination. LTCS-Report (03-03), See http://lat.inf.tu-dresden.de/research/reports.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morawska, B. (2003). Completeness of E-Unification with Eager Variable Elimination. In: Vardi, M.Y., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2003. Lecture Notes in Computer Science(), vol 2850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39813-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-39813-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20101-4
Online ISBN: 978-3-540-39813-4
eBook Packages: Springer Book Archive