Advertisement

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

  • Ta Chen
  • Siva Anantharaman
System Description
Part of the Lecture Notes in Computer Science book series (LNCS, volume 914)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3:203–216, 1987.Google Scholar
  3. 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. 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. 5.
    W. McCune. Experiments with discrimination-tree indexing and path indexing for term retrieval. Journal of Automated Reasoning, 9:147–167, 1992.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Ta Chen
    • 1
  • Siva Anantharaman
    • 2
  1. 1.Department of Computer ScienceSUNY at Stony BrookStony BrookUSA
  2. 2.Département d'InformatiqueLIFO, Université d'OrléansOrléans Cédex 02France

Personalised recommendations