Rewriting techniques and applications : 9th international conference, RTA-98, Tsukuba, Japan, March 28-April 1, 1998 : proceedings / Tobias Nipkow (ed.).

Other author Nipkow, Tobias, 1958-
Other author International Conference on Rewriting Techniques and Applications 1998 : Tsukuba-shi, Japan)
Format Book
Publication InfoBerlin ; New York : Springer, 1998.
Descriptionx, 342 pages ; 24 cm.
Subjects

SeriesLecture notes in computer science ; 1379
Lecture notes in computer science 1379. ^A466336
Contents Origin tracking in term rewriting / Jan Willem Klop -- Simultaneous critical pairs and Church-Rosser property / Satoshi Okui -- Church-Rosser theorems for abstract reduction modulo an equivalence relation / Enno Ohlebusch -- Automatic monoids versus monoids with finite convergent presentations / Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener -- Decidable and undecidable second-order unification problems / Jordi Levy -- On the exponent of periodicity of minimal solutions of context equations / Manfred Schmidt-Schauβ, Klaus U. Schulz -- Unification in extensions of shallow equational theories / Florent Jacquemard, Christoph Meyer, Christoph Weidenbach -- Unification and matching in process algebras / Qing Guo, Paliath Narendran, Sandeep K. Shukla -- E-unification for subsystems of S4 / Renate A. Schmidt -- Solving disequations modulo some class of rewrite systems / Sébastien Limet, Pierre Réty -- About proofs by consistency / Hubert Comon -- Normalization of S-terms is decidable / Johannes Waldmann -- Decidable approximations of sets of descendants and sets of normal forms / Thomas Genet -- Algorithms and reductions for rewriting problems / Rakesh M. Verma, Michael Rusinowitsch, Denis Lugiez -- The decidability of simultaneous rigid e-unification with one variable / Anatoli Degtyarev ... [et al.] -- Ordering constraints over feature trees expressed in second-order monadic logic / Martin Müller, Joachim Niehren -- Co-definite set constraints / Witold Charatonik, Andreas Podelski -- Modularity of termination using dependency pairs / Thomas Arts, Jürgen Giesl -- Termination of associative-commutative rewriting by dependency pairs / Claude Marché, Xavier Urbain -- Termination transformation by tree lifting ordering / Takahito Aoto, Yoshihito Toyama -- Towards automated termination proofs through "freezing" / Hongwei Xi -- Higher-order rewriting and partial evaluation / Olivier Danvy, Kristoffer Høgsbro Rose -- SN combinators and partial combinatory algebras / Yohji Akama -- Coupling saturation-based provers by exchanging positive/negative information / Dirk Fuchs -- An on-line problem database / Nachum Dershowitz, Ralf Treinen.
General note"Papers presented at the 9th International Conference on Rewriting Techniques and Applications (RTA-98) ... "--Pref.
Bibliography noteIncludes bibliographical references and index.
LCCN 98006357
ISBN354064301X (alk. paper)

Availability

Library Location Call Number Status Item Actions
Joyner General Stacks QA267 .R48 1998 ✔ Available Place Hold