Conference paper
A Comparison of End-to-End Decision Forest Inference Pipelines
Hong Guan, Saif Masood, et al.
SoCC 2023
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.
Hong Guan, Saif Masood, et al.
SoCC 2023
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Matthew Arnold, David Piorkowski, et al.
IBM J. Res. Dev