Skip to main content
SpringerLink
Log in

STORM: A many-to-one associative-commutative matcher

  • System Description
  • Conference paper
  • First Online:
Book cover Rewriting Techniques and Applications (RTA 1995)

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

Included in the following conference series:

Research supported in part by NSF grants CCR-9102159, CCR-9404921, CDA-9303181 and INT-9314412 and a grant from the GDR-Programmation (CNRS).

Research supported in part by a grant from the GDR-Programmation (CNRS).

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.

References

  1. L. Bachmair, T. Chen, and I.V. Ramakrishnan. Associative-commutative discrimination nets. In Proceedings of the 4th International Joint Conference on Theory and Practice of Software Development, CAPP/FASE, pages 61–74, Orsay, France, April 1993. Springer-Verlag LNCS 668.

    Google Scholar 

  2. D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3:203–216, 1987.

    Google Scholar 

  3. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243–309. Elsevier, 1990.

    Google Scholar 

  4. D. E. Knuth and P. B. Bendix. Simple world problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, Oxford, 1970.

    Google Scholar 

  5. W. McCune. Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning, 9:147–167, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY at Stony Brook, 11794, Stony Brook, NY, USA

    Ta Chen

  2. Département d'Informatique, LIFO, Université d'Orléans, 45067, Orléans Cédex 02, France

    Siva Anantharaman

Authors
  1. Ta Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siva Anantharaman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jieh Hsiang

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, T., Anantharaman, S. (1995). STORM: A many-to-one associative-commutative matcher. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-59200-8_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59200-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation