A Human Oriented Logic for Automatic Theorem-Proving
Journal of the ACM (JACM)
Universal Unification and a Classification of Equational Theories
Proceedings of the 6th Conference on Automated Deduction
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Equational theory of context unification is undecidable
Theoretical Computer Science
On Word Equations in One Variable
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
An Efficient Derivation for Elementary Formal Systems Based on Partial Unification
DS '01 Proceedings of the 4th International Conference on Discovery Science
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
A New Rewrite Method for Convergence of Self-Stabilizing Systems
Proceedings of the 13th International Symposium on Distributed Computing
Equations in free semigroups with involution and their relation to equations in free groups
Theoretical Computer Science - Latin American theoretical informatics
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
An efficient algorithm for solving word equations
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Solving equations with sequence variables and sequence functions
Journal of Symbolic Computation
XCentric: logic programming for XML processing
Proceedings of the 9th annual ACM international workshop on Web information and data management
Journal of Symbolic Computation
On the relation between Context and Sequence Unification
Journal of Symbolic Computation
Decision procedures for algebraic data types with abstractions
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Sequence unification through currying
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Deciding functional lists with sublist sets
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Z3-str: a z3-based string solver for web application analysis
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
| Hi-index | 0.01 |
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.