Affiliation:
1. IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference13 articles.
1. BENNETT J. H. CRT-aided semi-automated mathematics. AFCRL 67-0167. Applied Logic Corporation Princeton N.J. 1967. BENNETT J. H. CRT-aided semi-automated mathematics. AFCRL 67-0167. Applied Logic Corporation Princeton N.J. 1967.
2. BULITKO V.K. Equations and inequalities in a free group and a free semigroup. Tul. Gos. Ped. Inst. Ucen. Zap. Mat. Kafedr Vyp 2 Geometr. i Algebra (1970) 242-252 (in Russian). BULITKO V.K. Equations and inequalities in a free group and a free semigroup. Tul. Gos. Ped. Inst. Ucen. Zap. Mat. Kafedr Vyp 2 Geometr. i Algebra (1970) 242-252 (in Russian).
3. Theorem-proving in arithmetic without multiplication;COOPER D. C;Mach. Int.,1972
4. HMELEVSKII JU. I. Equations in free semigroups. Trudy Mat. Inst. Steklov 107 (1971) (English translation
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Associative unification in Maude;Journal of Logical and Algebraic Methods in Programming;2022-04
2. Word equations in non-deterministic linear space;Journal of Computer and System Sciences;2022-02
3. Unranked Nominal Unification;Lecture Notes in Computer Science;2022
4. Recompression: Technique for Word Equations and Compressed Data;Language and Automata Theory and Applications;2020
5. Strings at MOSCA;ACM SIGLOG News;2019-11-25