default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th RTA 1998: Tsukuba, Japan
- Tobias Nipkow
:
Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings. Lecture Notes in Computer Science 1379, Springer 1998, ISBN 3-540-64301-X - Jan Willem Klop:
Origin Tracking in Term Rewriting (Abstract). 1 - Satoshi Okui:
Simultaneous Critical Pairs and Church-Rosser Property. 2-16 - Enno Ohlebusch:
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. 17-31 - Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener:
Automatic Monoids Versus Monoids with Finite Convergent Presentations. 32-46 - Jordi Levy:
Decidable and Undecidable Second-Order Unification Problems. 47-60 - Manfred Schmidt-Schauß, Klaus U. Schulz:
On the Exponent of Periodicity of Minimal Solutions of Context Equation. 61-75 - Florent Jacquemard, Christoph Meyer, Christoph Weidenbach:
Unification in Extension of Shallow Equational Theories. 76-90 - Qing Guo, Paliath Narendran, Sandeep K. Shukla:
Unification and Matching in Process Algebras. 91-105 - Renate A. Schmidt:
E-Unification for Subsystems of S4. 106-120 - Sébastien Limet, Pierre Réty:
Solving Disequations Modulo Some Class of Rewrite Systems. 121-135 - Hubert Comon:
About Proofs by Consistency (Abstract). 136-137 - Johannes Waldmann:
Normalization of S-Terms is Decidable. 138-150 - Thomas Genet:
Decidable Approximations of Sets of Descendants and Sets of Normal Forms. 151-165 - Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez:
Algorithms and Reductions for Rewriting Problems. 166-180 - Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable. 181-195 - Martin Müller, Joachim Niehren:
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic. 196-210 - Witold Charatonik, Andreas Podelski:
Co-definite Set Constraints. 211-225 - Thomas Arts, Jürgen Giesl:
Modularity of Termination Using Dependency pairs. 226-240 - Claude Marché, Xavier Urbain:
Termination of Associative-Commutative Rewriting by Dependency Pairs. 241-255 - Takahito Aoto, Yoshihito Toyama:
Termination Transformation by Tree Lifting Ordering. 256-270 - Hongwei Xi:
Towards Automated Termination Proofs through "Freezing". 271-285 - Olivier Danvy, Kristoffer Høgsbro Rose:
Higher-Order Rewriting and Partial Evaluation. 286-301 - Yohji Akama:
SN Combinators and Partial Combinatory Algebras. 302-316 - Dirk Fuchs:
Coupling Saturation-Based Provers by Exchanging Positive/Negative Information. 317-331 - Nachum Dershowitz, Ralf Treinen:
An On-line Problem Database. 332-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-18 00:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
