Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arnborg, S. and Tidén, E. (1985), Unification problems with one-sided distributivity, in J.-P. Jouannaud (ed.), Proc. Intern. Conf. on Rewriting Techniques and Applications, Vol. 202 of LNCS, Springer, pp. 398–406.
2. Auffray, Y. and Enjalbert, P. (1992), Modal theorem proving: An equational viewpoint, Journal of Logic and Computation
2(3), 247–297.
3. Comon, H., Haberstrau, M. and Jouannaud, J.-P. (1994), Syntacticness, cyclesyntacticness and shallow theories, Information and Computation
111(1), 154–191.
4. Doggaz, N. and Kirchner, C. (1991), Completion for unification, Theoretical Computer Science
85, 231–251.
5. Farinas del Cerro, L. and Herzig, A. (1989), Automated quantified modal logic, in P. B. Brazdil and K. Konolige (eds), Machine Learning, Meta-Reasoning and Logics, Kluwer, pp. 301–317.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献