|
|
|
|
LEADER |
02960nmm a2200361 u 4500 |
001 |
EB000658001 |
003 |
EBX01000000000000000511083 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
140122 ||| eng |
020 |
|
|
|a 9783540476368
|
100 |
1 |
|
|a Abdulrab, Habib
|e [editor]
|
245 |
0 |
0 |
|a Word Equations and Related Topics
|h Elektronische Ressource
|b Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings
|c edited by Habib Abdulrab, Jean-Pierre Pecuchet
|
250 |
|
|
|a 1st ed. 1993
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1993, 1993
|
300 |
|
|
|a VIII, 220 p
|b online resource
|
505 |
0 |
|
|a 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
|
653 |
|
|
|a Artificial intelligence / Data processing
|
653 |
|
|
|a Mathematical logic
|
653 |
|
|
|a Artificial Intelligence
|
653 |
|
|
|a Formal Languages and Automata Theory
|
653 |
|
|
|a Machine theory
|
653 |
|
|
|a Artificial intelligence
|
653 |
|
|
|a Mathematical Logic and Foundations
|
653 |
|
|
|a Data Science
|
700 |
1 |
|
|a Pecuchet, Jean-Pierre
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
490 |
0 |
|
|a Lecture Notes in Computer Science
|
028 |
5 |
0 |
|a 10.1007/3-540-56730-5
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-56730-5?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 511.3
|
520 |
|
|
|a 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
|