Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. H. Abdulrab and J.-P. Pécuchet. Solving word equations. J. Symbolic Computation, 8(5):499–522, 1990.
2. F. Baader and W. Snyder. Unification theory. In A. Robinson and A. Voron-kov, editors, Handbook of Automated Reasoning, volume I, pages 445–532. Elsevier Science, 2001.
3. M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. String operations in query languages. In Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001.
4. B. Buchberger. Mathematica as a rewrite language. In T. Ida, A. Ohori, and M. Takeichi, editors, Proceedings of the 2nd Fuji International Workshop on Functional and Logic Programming), pages 1–13, Shonan Village Center, Japan, 1–4 November 1996. World Scientific.
5. B. Buchberger. Personal communication, 2001.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving Proximity Constraints;Logic-Based Program Synthesis and Transformation;2020
2. Variadic Equational Matching;Lecture Notes in Computer Science;2019
3. Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System;Programming Languages and Systems;2015
4. Matching with Regular Constraints;Logic for Programming, Artificial Intelligence, and Reasoning;2005
5. Formalization of UML state machines using temporal logic;Software & Systems Modeling;2004-03