Completeness of E-Unification with Eager Variable Elimination | SpringerLink
Skip to main content
Springer Nature Link
Log in

Completeness of E-Unification with Eager Variable Elimination

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2850))

  • 295 Accesses

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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baader, F., Nipkow, T.: Term Rewriting and All That, Cambridge (1998)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Gallier, J., Snyder, W.: Complete sets of transformations for general E-unification. In: TCS, vol. 67, pp. 203–260 (1989)

    Google Scholar 

  4. Hölldobler, S.: Foundations of Equational Logic Programming. LNCS (LNAI), vol. 353. Springer, Heidelberg (1989)

    Book  MATH  Google Scholar 

  5. Kirchner, C., Kirchner, H.: Rewriting, Solving, Proving (2000), http://www.loria.fr/~ckirchne/

  6. 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)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. Morawska, B.: Completeness of E-unification with eager Variable Elimination. LTCS-Report (03-03), See http://lat.inf.tu-dresden.de/research/reports.html

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science, TU Dresden, D-01062, Dresden, Germany

    Barbara Morawska

Authors
  1. Barbara Morawska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rice University, 77251-1892, Houston, TX, U.S.A.

    Moshe Y. Vardi

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation