Author:
Hermann Miki,Kolaitis Phokion G.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3:203–216, 1987.
2. R. Book and J. Siekmann. On unification: equational theories are not bounded. Journal of Symbolic Computation, 2:317–324, 1986.
3. N. Creignou and M. Hermann. On #P-completeness of some counting problems. Research report 93-R-188, Centre de Recherche en Informatique de Nancy, 1993.
4. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 & 2):69–116, 1987. Special issue on Rewriting Techniques and Applications.
5. E. Domenjoud. Number of minimal unifiers of the equation αx1+⋯+αxb, =ac Βy1+⋯+Βyq. Journal of Automated Reasoning, 8:39–44, 1992.