LEADER 04745nam 22007815 450 001 9910143455003321 005 20250731082151.0 010 $a3-540-69721-7 024 7 $a10.1007/BFb0052355 035 $a(CKB)1000000000210907 035 $a(SSID)ssj0000326351 035 $a(PQKBManifestationID)11248966 035 $a(PQKBTitleCode)TC0000326351 035 $a(PQKBWorkID)10296875 035 $a(PQKB)11363510 035 $a(DE-He213)978-3-540-69721-3 035 $a(MiAaPQ)EBC5596291 035 $a(MiAaPQ)EBC6489938 035 $a(Au-PeEL)EBL5596291 035 $a(OCoLC)1076265195 035 $a(PPN)155167804 035 $a(EXLCZ)991000000000210907 100 $a20121227d1998 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications $e9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings /$fedited by Tobias Nipkow 205 $a1st ed. 1998. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1998. 215 $a1 online resource (X, 346 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v1379 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-64301-X 327 $aOrigin tracking in term rewriting -- Simultaneous critical pairs and Church-Rosser property -- Church-Rosser theorems for abstract reduction modulo an equivalence relation -- Automatic monoids versus monoids with finite convergent presentations -- Decidable and undecidable second-order unification problems -- On the exponent of periodicity of minimal solutions of context equations -- Unification in extensions of shallow equational theories -- Unification and matching in process algebras -- E-unification for subsystems of S4 -- Solving disequations modulo some class of rewrite systems -- About proofs by consistency -- Normalization of S-terms is decidable -- Decidable approximations of sets of descendants and sets of normal forms -- Algorithms and reductions for rewriting problems -- The decidability of simultaneous rigid E-unification with one variable -- Ordering constraints over feature trees expressed in second-order monadic logic -- Co-definite set constraints -- Modularity of termination using dependency pairs -- Termination of associative-commutative rewriting by dependency pairs -- Termination transformation by tree lifting ordering -- Towards automated termination proofs through ?freezing? -- Higher-order rewriting and partial evaluation -- SN combinators and partial combinatory algebras -- Coupling saturation-based provers by exchanging positive/negative information -- An on-line problem database. 330 $aThis book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of 61 submissions by the program committee with the assistance of 113 additional referees. The book covers all current aspects of rewriting including rewriting systems, term rewriting, string rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v1379 606 $aCompilers (Computer programs) 606 $aMachine theory 606 $aComputer science 606 $aArtificial intelligence 606 $aLogic, Symbolic and mathematical 606 $aCompilers and Interpreters 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aArtificial Intelligence 606 $aMathematical Logic and Foundations 615 0$aCompilers (Computer programs) 615 0$aMachine theory. 615 0$aComputer science. 615 0$aArtificial intelligence. 615 0$aLogic, Symbolic and mathematical. 615 14$aCompilers and Interpreters. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aArtificial Intelligence. 615 24$aMathematical Logic and Foundations. 676 $a005.131 702 $aNipkow$b Tobias$f1958- 712 12$aInternational Conference on Rewriting Techniques and Applications$d(9th :$f1998 :$eTsukuba-shi, Japan) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143455003321 996 $aRewriting Techniques and Applications$9774195 997 $aUNINA