Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Word Equations and Related Topics

IWWERT 1991: Word Equations and Related Topics pp 79–89Cite as

A case of termination for associative unification

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 677))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Y. Auffray P.Enjalbert: Modal Theorem Proving: An Equational Viewpoint, Submitted to the Journal of Logic and Computation 1990

    Google Scholar 

  2. F.Clerin-Debart: Théories équationnelles et de contraintes pour la déduction automatique en logique modale Thèse de L'université de Caen 1992

    Google Scholar 

  3. F.Debart, P.Enjalbert, M.Lescot: Multi-modal automated Deduction Using Equational And Order-Sorted Logic. Proc 2nd.Conf on Conditional and typed Rewriting Systems, Montreal 1990. To appear in Springer LNCS, M.Okada&S.Kaplan Ed. 1991

    Google Scholar 

  4. F.Fages G.Huet Complete sets of unifiers and matchers in equational theories. Theor. Computer Science 43, 1986, 189–200.

    Google Scholar 

  5. G.Huet: Confluent Reductions. Abstract Properties and Applications to Terms Rewriting Systems. Journal of the Ass. for Comptuting Machinery. Vol 27 Nℴ4 10–1980

    Google Scholar 

  6. J.P.Jouannaud C.Kirchner: Solving equations in Abstract Algebras: A rule-based Survey of Unification. Rapp.de Rech. Nℴ561 CNRS UA 410

    Google Scholar 

  7. H.J.Ohlbach: A resolution calculus for Modal Logics. 9th Int. Conf. on automated deduction. LCNS 310, Springer Verlag 1988

    Google Scholar 

  8. G.D.Plotkin: Building-in Equational Theory. Machine Intelligence 7, 73–90, 1972

    Google Scholar 

  9. G.D.Plotkin: Some Unification Algorithms. Research Memorandum. School of Artificial Intelligence, University of Edinburgh

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Caen, 14032, Caen Cedex, France

    Patrice Enjalbcrt & FranÇoise Clerin-Debart

Authors
  1. Patrice Enjalbcrt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. FranÇoise Clerin-Debart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Habib Abdulrab Jean-Pierre Pécuchet

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Enjalbcrt, P., Clerin-Debart, F. (1993). A case of termination for associative unification. In: Abdulrab, H., Pécuchet, JP. (eds) Word Equations and Related Topics. IWWERT 1991. Lecture Notes in Computer Science, vol 677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56730-5_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-56730-5_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56730-1

  • Online ISBN: 978-3-540-47636-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation