Word Equations and Related Topics [electronic resource] : Second International Workshop, IWWERT '91 Rouen, France, October 7–9, 1991 Proceedings / edited by Habib Abdulrab, Jean-Pierre Pécuchet.Material type: TextLanguage: English Series: Lecture Notes in Computer Science: 677Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1993Description: VIII, 220 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540476368Subject(s): Computer science | Data structures (Computer science) | Artificial intelligence | Logic, Symbolic and mathematical | Computer Science | Mathematical Logic and Formal Languages | Data Structures | Artificial Intelligence (incl. Robotics) | Mathematical Logic and FoundationsAdditional physical formats: Printed edition:: No titleDDC classification: 005.131 LOC classification: QA8.9-QA10.3Online resources: Click here to access online
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.
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.