Arnold L. Rosenberg
Journal of the ACM
The fundamental satisfiability problem for word equations has been solved recently by Makanin. However, this algorithm is purely a decision algorithm. The main result of this paper solves the complementary problem of generating the set of all solutions. Specifically, the algorithm in this paper generates, given a word equation, a minimal and complete set of unifiers. It stops if this set is finite. © 1990, ACM. All rights reserved.
Arnold L. Rosenberg
Journal of the ACM
Joseph Y. Halpern, Yoram Moses
Journal of the ACM
Joseph Y. Halpern
aaai 1996
Shuang Chen, Herbert Freeman
International Journal of Pattern Recognition and Artificial Intelligence