LEADER 04219nam  22006375  450 
001 996466083803316
005 20200707013603.0
010   $a3-540-47636-9
024 7 $a10.1007/3-540-56730-5
035   $a(CKB)1000000000233961
035   $a(SSID)ssj0000327650
035   $a(PQKBManifestationID)11245614
035   $a(PQKBTitleCode)TC0000327650
035   $a(PQKBWorkID)10301578
035   $a(PQKB)11102667
035   $a(DE-He213)978-3-540-47636-8
035   $a(PPN)155215442
035   $a(EXLCZ)991000000000233961
100   $a20121227d1993      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aWord Equations and Related Topics$b[electronic resource] $eSecond International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings /$fedited by Habib Abdulrab, Jean-Pierre Pecuchet
205   $a1st ed. 1993.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993.
215   $a1 online resource (VIII, 220 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v677
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-56730-5 
327   $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.
330   $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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v677
606   $aMathematical logic
606   $aArtificial intelligence
606   $aData structures (Computer science)
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
606   $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017
615  0$aMathematical logic.
615  0$aArtificial intelligence.
615  0$aData structures (Computer science).
615 14$aMathematical Logic and Foundations.
615 24$aArtificial Intelligence.
615 24$aMathematical Logic and Formal Languages.
615 24$aData Structures.
676   $a006.3/5
702   $aAbdulrab$b Habib$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPecuchet$b Jean-Pierre$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aIWWERT '91
906   $aBOOK
912   $a996466083803316
996   $aWord Equations and Related Topics$92829821
997   $aUNISA