This 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.
Author(s): J. W. Klop (auth.), Tobias Nipkow (eds.)
Series: Lecture Notes in Computer Science 1379
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998
Language: English
Pages: 346
Tags: Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations
Origin tracking in term rewriting....Pages 1-1
Simultaneous critical pairs and Church-Rosser property....Pages 2-16
Church-Rosser theorems for abstract reduction modulo an equivalence relation....Pages 17-31
Automatic monoids versus monoids with finite convergent presentations....Pages 32-46
Decidable and undecidable second-order unification problems....Pages 47-60
On the exponent of periodicity of minimal solutions of context equations....Pages 61-75
Unification in extensions of shallow equational theories....Pages 76-90
Unification and matching in process algebras....Pages 91-105
E -unification for subsystems of S4 ....Pages 106-120
Solving disequations modulo some class of rewrite systems....Pages 121-135
About proofs by consistency....Pages 136-137
Normalization of S-terms is decidable....Pages 138-150
Decidable approximations of sets of descendants and sets of normal forms....Pages 151-165
Algorithms and reductions for rewriting problems....Pages 166-180
The decidability of simultaneous rigid E -unification with one variable....Pages 181-195
Ordering constraints over feature trees expressed in second-order monadic logic....Pages 196-210
Co-definite set constraints....Pages 211-225
Modularity of termination using dependency pairs....Pages 226-240
Termination of associative-commutative rewriting by dependency pairs....Pages 241-255
Termination transformation by tree lifting ordering....Pages 256-270
Towards automated termination proofs through “freezing”....Pages 271-285
Higher-order rewriting and partial evaluation....Pages 286-301
SN combinators and partial combinatory algebras....Pages 302-316
Coupling saturation-based provers by exchanging positive/negative information....Pages 317-331
An on-line problem database....Pages 332-342
