LEADER 06185nam 22007575 450 001 996465416803316 005 20200704120645.0 010 $a3-540-46383-6 024 7 $a10.1007/3-540-53904-2 035 $a(CKB)1000000000233630 035 $a(SSID)ssj0000326353 035 $a(PQKBManifestationID)11242588 035 $a(PQKBTitleCode)TC0000326353 035 $a(PQKBWorkID)10296467 035 $a(PQKB)11743677 035 $a(DE-He213)978-3-540-46383-2 035 $a(PPN)155214373 035 $a(EXLCZ)991000000000233630 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRewriting Techniques and Applications$b[electronic resource] $e4th International Conference, RTA-91, Como, Italy, April 10-12, 1991. Proceedings /$fedited by Ronald V. Book 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (X, 462 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v488 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-53904-2 327 $aTransfinite reductions in orthogonal term rewriting systems -- Redex capturing in term graph rewriting (concise version) -- Rewriting, and equational unification: the higher-order cases -- Adding algebraic rewriting to the untyped lambda calculus (extended abstract) -- Incremental termination proofs and the length of derivations -- Time bounded rewrite systems and termination proofs by generalized embedding -- Detecting redundant narrowing derivations by the LSE-SL reducibility test -- Unification, weak unification, upper bound, lower bound, and generalization problems -- AC unification through order-sorted AC1 unification -- Narrowing directed by a graph of terms -- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification -- Undecidable properties of syntactic theories -- Goal directed strategies for paramodulation -- Minimal solutions of linear diophantine systems : bounds and algorithms -- Proofs in parameterized specifications -- Completeness of combinations of constructor systems -- Modular higher-order E-unification -- On confluence for weakly normalizing systems -- Program transformation and rewriting -- An efficient representation of arithmetic for term rewriting -- Query optimization using rewrite rules -- Boolean algebra admits no convergent term rewriting system -- Decidability of confluence and termination of monadic term rewriting systems -- Bottom-up tree pushdown automata and rewrite systems -- On relationship between term rewriting systems and regular tree languages -- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree -- Left-to-right tree pattern matching -- Incremental techniques for efficient normalization of nonlinear rewrite systems -- On fairness of completion-based theorem proving strategies -- Proving equational and inductive theorems by completion and embedding techniques -- Divergence phenomena during completion -- Simulating Buchberger's algorithm by Knuth-Bendix completion -- On proving properties of completion strategies -- On ground AC-completion -- Any ground associative-commutative theory has a finite canonical system -- A narrowing-based theorem prover -- ANIGRAF: An interactive system for the animation of graph rewriting systems with priorities -- Emmy: A refutational theorem prover for first-order logic with equations -- The tecton proof system -- Open problems in rewriting. 330 $aThis volume contains the proceedings of the Fourth International Conference on Rewriting Techniques and Applications (RTA-91), held in Como, Italy, April 10-12, 1991. The volume includes 40 papers on a wide variety of topics including: term rewriting systems, equational unification, algebraic rewriting, termination proofs, generalization problems, undecidable properties, parametrized specifications, normalizing systems, program transformation, query optimization, tree languages, graph languages, theorem proving systems, completion, graph rewriting systems, and open problems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v488 606 $aComputers 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aMathematical logic 606 $aComputer science?Mathematics 606 $aProgramming languages (Electronic computers) 606 $aAlgorithms 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aSymbolic and Algebraic Manipulation$3https://scigraph.springernature.com/ontologies/product-market-codes/I17052 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aComputers. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aMathematical logic. 615 0$aComputer science?Mathematics. 615 0$aProgramming languages (Electronic computers). 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aApplications of Mathematics. 615 24$aMathematical Logic and Formal Languages. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a004.0151 702 $aBook$b Ronald V$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465416803316 996 $aRewriting Techniques and Applications$9774195 997 $aUNISA