Complexity of matching problems-Reference-Cited by-同舟云学术

Complexity of matching problems

Published:1985 Issue: Volume: Page:417-429
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Benanav Dan,Kapur Deepak,Narendran Paliath

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-15976-2_22.pdf

Reference14 articles.

1. Garey, M.R. and Johnson, D.S., Computers and Intractability, W.H. Freeman, 1979.

2. Hullot, J.M., „Associative-Commutative Pattern Matching,” Fifth International Joint Conference on Artificial Intelligence, Tokyo, Japan, 1979.

3. Iwama, K., „On Equations Including String Variables,” Proc. 23rd Ann. Symp. on Foundations of Computer Science, 1982, pp. 226–235.

4. Kanellakis, P., private communication.

5. Kapur, D. and Sivakumar, G., „Architecture of and Experiments with RRL, a Rewrite Rule Laboratory,” Proceedings of a NSF Workshop on the Rewrite Rule Laboratory, September 6–9, 1983, General Electric CRD Report, 84GEN004, April, 1984, pp. 33–56.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Elementary Deduction Problem for Locally Stable Theories with Normal Forms;Electronic Proceedings in Theoretical Computer Science;2013-03-28

2. Lazy AC-Pattern Matching for Rewriting;Electronic Proceedings in Theoretical Computer Science;2012-04-24

3. Foundations of Rule-Based Query Answering;Reasoning Web;2007

4. Multitree automata that count;Theoretical Computer Science;2005-03

5. Efficient Algorithms for Computing Modulo Permutation Theories;Automated Reasoning;2004