000 05001nam a22005415i 4500
001 978-3-540-46383-2
003 DE-He213
005 20160624102014.0
007 cr nn 008mamaa
008 121227s1991 gw | s |||| 0|eng d
020 _a9783540463832
_9978-3-540-46383-2
024 7 _a10.1007/3-540-53904-2
_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 _aRewriting Techniques and Applications
_h[electronic resource] :
_b4th International Conference, RTA-91 Como, Italy, April 10–12, 1991 Proceedings /
_cedited by Ronald V. Book.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1991.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1991.
300 _aX, 462 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 ;
_v488
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aAlgebra
_xData processing.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aBook, Ronald V.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540539049
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v488
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-53904-2
942 _2EBK5767
_cEBK
999 _c35061
_d35061