Conference paper
Toward Scientific Workflows in a Serverless World
Aakash Khochare, Yogesh Simmhan, et al.
eScience 2022
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.
Aakash Khochare, Yogesh Simmhan, et al.
eScience 2022
Alex Golts, Daniel Khapun, et al.
MICCAI 2021
Kaiyuan Zhang, Guanhong Tao, et al.
ICLR 2023
Yale Song, Zhen Wen, et al.
IJCAI 2013