Akari Asai, Zeqiu Wu, et al.
ICLR 2024
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.
Akari Asai, Zeqiu Wu, et al.
ICLR 2024
Yale Song, Zhen Wen, et al.
IJCAI 2013
Rocco Langone, Carlos Alzate, et al.
SSCI 2013
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995