Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation Vol. 121, No. 2 (1995) pp. 172–192.
2. J. Chabin, and P. Réty. Narrowing directed by a graph of terms. In Proc. 4th Int. Conf. on Rewriting Techniques and Applications, Lect. Notes in Computer Science, vol. 488, pp. 112–123, Springer-Verlag.
3. H. Comon. Solving Symbolic Ordering Constraints. International Journal of Foundations of Computer Science 1 (1990) pp. 387–411.
4. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen editor, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6, pp. 243–320. North-Holland, Amsterdam, 1990.
5. N. Dershowitz and G. Sivakumar. Solving goals in equational languages. In Proc. of the First Intl. Workshop on Conditional and Typed Rewriting Systems, Lect. Notes in Comput. Sci., vol. 308, (1987) pp. 45–55.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The unification problem for one relation Thue Systems;Artificial Intelligence and Symbolic Computation;1998