TY  - BOOK
AU  - Abdulrab,Habib
AU  - Pécuchet,Jean-Pierre
ED  - SpringerLink (Online service)
TI  - Word Equations and Related Topics: Second International Workshop, IWWERT '91 Rouen, France, October 7–9, 1991 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540476368
AV  - QA8.9-QA10.3 
U1  - 005.131 23
PY  - 1993///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Data structures (Computer science)
KW  - Artificial intelligence
KW  - Logic, Symbolic and mathematical
KW  - Computer Science
KW  - Mathematical Logic and Formal Languages
KW  - Data Structures
KW  - Artificial Intelligence (incl. Robotics)
KW  - Mathematical Logic and Foundations
N1  - On general solution of equations in a free semigroup -- Conjugacy in free inverse monoids -- General A- and AX-unification via optimized combination procedures -- Word equations with two variables -- The naming problem for left distributivity -- A case of termination for associative unification -- Theorem proving by combinatorial optimization -- Solving string equations with constant restrictions -- LOP: Toward a new implementation of Makanin's Algorithm -- Word unification and transformation of generalized equations -- Unification in the combination of disjoint theories -- On the subsets of rank two in a free monoid: A fast decision algorithm -- A solution of the complement problem in associatiue-commutatiue theories
N2  - This volume contains papers presented at the second International Workshop on Word Equations and Related Topics (IWWERT '91), held at the University ofRouen in October 1991. The papers are on the following topics: general solution of word equations, conjugacy in free inverse monoids, general A- and AX-unification via optimized combination procedures, wordequations with two variables, a conjecture about conjugacy in free groups, acase of termination for associative unification, theorem proving by combinatorial optimization, solving string equations with constant restriction, LOP (toward a new implementation of Makanin's algorithm), word unification and transformation of generalizedequations, unification in the combination of disjoint theories, on the subsets of rank two in a free monoid (a fast decision algorithm), and a solution of the complement problem in associative-commutative theories
UR  - http://dx.doi.org/10.1007/3-540-56730-5
ER  -