000 03623nam a22005415i 4500
001 978-3-540-47636-8
003 DE-He213
005 20160624102025.0
007 cr nn 008mamaa
008 121227s1993 gw | s |||| 0|eng d
020 _a9783540476368
_9978-3-540-47636-8
024 7 _a10.1007/3-540-56730-5
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aWord Equations and Related Topics
_h[electronic resource] :
_bSecond International Workshop, IWWERT '91 Rouen, France, October 7–9, 1991 Proceedings /
_cedited by Habib Abdulrab, Jean-Pierre Pécuchet.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1993.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1993.
300 _aVIII, 220 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v677
505 0 _aOn 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aArtificial intelligence.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aData Structures.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Foundations.
700 1 _aAbdulrab, Habib.
_eeditor.
700 1 _aPécuchet, Jean-Pierre.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540567301
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v677
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-56730-5
942 _2EBK6136
_cEBK
999 _c35430
_d35430