Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1999: Rewriting Techniques and Applications pp 248–251Cite as

UniMoK: A System for Combining Equational Unification Algorithms

  • Conference paper
  • First Online:

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

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Franz Baader and Klaus U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. JSC, 21:211–243, 1996.

    MATH  MathSciNet  Google Scholar 

  2. Franz Baader and Klaus U. Schulz. Combination of constraint solvers for free and quasi-free structures. Theoretical Computer Science, 192:107–161, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. Alexandre Boudet. Combining unification algorithms. JSC, 16(6):597–626, 1993.

    MATH  MathSciNet  Google Scholar 

  4. Hans-Jurgen Burckert. A resolution principle for clauses with constraints. In Mark E. Stickel, editor, CADE-10, pp. 178–192, LNAI 449, Springer, 1990.

    Google Scholar 

  5. Xiaorong Huang, Manfred Kerber, Michael Kohlhase, Erica Melis, Dan Nesmith, Jörn Richts, and Jörg H. Siekmann. Keim: A toolkit for automated deduction. In Alan Bundy, editor, CADE-12, pp. 807–810, LNAI 814, Springer, 1994.

    Google Scholar 

  6. Jean-Pierre Jouannaud and Hèléne Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15:1155–1195, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  7. Stephan Kepser and Jörn Richts. Optimisation techniques for combining constraint solvers. In Maarten de Rijke and Dov M. Gabbay, editors, Frontiers of Combining Systems, FroCoS’98. Kluwer Academic Publishers, 1998.

    Google Scholar 

  8. Claude Kirchner and Hèléne Kirchner. Constrained equational reasoning. In Gaston H. Gonnet, editor, Proceedings of SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation: ISSAC’89, pages 382–389. ACM Press, 1989.

    Google Scholar 

  9. G.D. Plotkin. Building-in equational theories. Machine Intelligence, 7:73–90, 1972.

    MathSciNet  MATH  Google Scholar 

  10. Manfred Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. Journal of Symbolic Computation, 8(1,2):51–99, 1989.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SfS, University of Tübingen, Wilhelmstr., 133, 72074, Tübingen, Germany

    Stephan Kepser

  2. Theoretische Informatik, RWTH Aachen, Ahornstr., 55, 52074, Aachen, Germany

    Jörn Richts

Authors
  1. Stephan Kepser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jörn Richts
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University at Albany — SUNY, Albany, NY, 12222, USA

    Paliath Narendran

  2. LORIA — INRIA Lorraine 615, rue du Jardin Botanique, F-54602, Villers les Nancy, Cedex, France

    Michael Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kepser, S., Richts, J. (1999). UniMoK: A System for Combining Equational Unification Algorithms. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-48685-2_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66201-3

  • Online ISBN: 978-3-540-48685-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation