
Conferences in DBLP
 Jan Willem Klop
Origin Tracking in Term Rewriting (Abstract). [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:1 [Conf]
 Satoshi Okui
Simultaneous Critical Pairs and ChurchRosser Property. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:216 [Conf]
 Enno Ohlebusch
ChurchRosser Theorems for Abstract Reduction Modulo an Equivalence Relation. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:1731 [Conf]
 Friedrich Otto, Andrea SattlerKlein, Klaus Madlener
Automatic Monoids Versus Monoids with Finite Convergent Presentations. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:3246 [Conf]
 Jordi Levy
Decidable and Undecidable SecondOrder Unification Problems. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:4760 [Conf]
 Manfred SchmidtSchauß, Klaus U. Schulz
On the Exponent of Periodicity of Minimal Solutions of Context Equation. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:6175 [Conf]
 Florent Jacquemard, Christoph Meyer, Christoph Weidenbach
Unification in Extension of Shallow Equational Theories. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:7690 [Conf]
 Qing Guo, Paliath Narendran, Sandeep K. Shukla
Unification and Matching in Process Algebras. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:91105 [Conf]
 Renate A. Schmidt
EUnification for Subsystems of S4. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:106120 [Conf]
 Sébastien Limet, Pierre Réty
Solving Disequations Modulo Some Class of Rewrite Systems. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:121135 [Conf]
 Hubert Comon
About Proofs by Consistency (Abstract). [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:136137 [Conf]
 Johannes Waldmann
Normalization of STerms is Decidable. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:138150 [Conf]
 Thomas Genet
Decidable Approximations of Sets of Descendants and Sets of Normal Forms. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:151165 [Conf]
 Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez
Algorithms and Reductions for Rewriting Problems. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:166180 [Conf]
 Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
The Decidability of Simultaneous Rigid EUnification with One Variable. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:181195 [Conf]
 Martin Müller, Joachim Niehren
Ordering Constraints over Feature Trees Expressed in SecondOrder Monadic Logic. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:196210 [Conf]
 Witold Charatonik, Andreas Podelski
Codefinite Set Constraints. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:211225 [Conf]
 Thomas Arts, Jürgen Giesl
Modularity of Termination Using Dependency pairs. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:226240 [Conf]
 Claude Marché, Xavier Urbain
Termination of AssociativeCommutative Rewriting by Dependency Pairs. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:241255 [Conf]
 Takahito Aoto, Yoshihito Toyama
Termination Transformation by Tree Lifting Ordering. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:256270 [Conf]
 Hongwei Xi
Towards Automated Termination Proofs through "Freezing". [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:271285 [Conf]
 Olivier Danvy, Kristoffer Høgsbro Rose
HigherOrder Rewriting and Partial Evaluation. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:286301 [Conf]
 Yohji Akama
SN Combinators and Partial Combinatory Algebras. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:302316 [Conf]
 Dirk Fuchs
Coupling SaturationBased Provers by Exchanging Positive/Negative Information. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:317331 [Conf]
 Nachum Dershowitz, Ralf Treinen
An Online Problem Database. [Citation Graph (0, 0)][DBLP] RTA, 1998, pp:332342 [Conf]
