04219nam 22006375 450 99646608380331620200707013603.03-540-47636-910.1007/3-540-56730-5(CKB)1000000000233961(SSID)ssj0000327650(PQKBManifestationID)11245614(PQKBTitleCode)TC0000327650(PQKBWorkID)10301578(PQKB)11102667(DE-He213)978-3-540-47636-8(PPN)155215442(EXLCZ)99100000000023396120121227d1993 u| 0engurnn|008mamaatxtccrWord Equations and Related Topics[electronic resource] Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings /edited by Habib Abdulrab, Jean-Pierre Pecuchet1st ed. 1993.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1993.1 online resource (VIII, 220 p.) Lecture Notes in Computer Science,0302-9743 ;677Bibliographic Level Mode of Issuance: Monograph3-540-56730-5 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.Lecture Notes in Computer Science,0302-9743 ;677Mathematical logicArtificial intelligenceData structures (Computer science)Mathematical Logic and Foundationshttps://scigraph.springernature.com/ontologies/product-market-codes/M24005Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Mathematical logic.Artificial intelligence.Data structures (Computer science).Mathematical Logic and Foundations.Artificial Intelligence.Mathematical Logic and Formal Languages.Data Structures.006.3/5Abdulrab Habibedthttp://id.loc.gov/vocabulary/relators/edtPecuchet Jean-Pierreedthttp://id.loc.gov/vocabulary/relators/edtIWWERT '91BOOK996466083803316Word Equations and Related Topics2829821UNISA