Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 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.
Imran Nasim, Melanie Weber
SCML 2024
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Kazuaki Ishizaki, Takeshi Ogasawara, et al.
VEE 2012
Miao Guo, Yong Tao Pei, et al.
WCITS 2011