Tessa Lau
AI Magazine
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.
Tessa Lau
AI Magazine
Balaji Ganesan, Arjun Ravikumar, et al.
ICON 2023
Dzung Phan, Vinicius Lima
INFORMS 2023
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025