
Conferences in DBLP
 José Meseguer
Rewriting Logic and Maude: Concepts and Applications. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:126 [Conf]
 Sophie Tison
Tree Automata and Term Rewrite Systems. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:2730 [Conf]
 Nikolaj Bjørner, César Muñoz
Absolute Explicit Unification. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:3146 [Conf]
 Frédéric Blanqui
Termination and Confluence of HigherOrder Rewrite Systems. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:4761 [Conf]
 Eduardo Bonelli, Delia Kesner, Alejandro Ríos
A de Bruijn Notation for HigherOrder Rewriting. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:6279 [Conf]
 Evelyne Contejean, Antoine Coste, Benjamin Monate
Rewriting Techniques in Theoretical Physics. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:8094 [Conf]
 Daniel J. Dougherty, Claudio Gutiérrez
Normal Forms and Reduction for Theories of Binary Relations. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:95109 [Conf]
 Katrin Erk, Joachim Niehren
Parallelism Constraints. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:110126 [Conf]
 Philippe de Groote
Linear HigherOrder Matching Is NPComplete. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:127140 [Conf]
 Felix Joachimski, Ralph Matthes
Standardization and Confluence for a Lambda Calculus with Generalized Applications. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:141155 [Conf]
 Jordi Levy, Mateu Villaret
Linear SecondOrder Unification and Context Unification with TreeRegular Constraints. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:156171 [Conf]
 Markus Lohrey
Word Problems and Confluence Problems for Restricted SemiThue Systems. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:172186 [Conf]
 Reinhard Pichler
The Explicit Representability of Implicit Generalizations. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:187202 [Conf]
 Richard Statman
On the Word Problem for Combinators. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:203213 [Conf]
 Georg Struth
An Algebra of Resolution. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:214228 [Conf]
 Jürgen Stuber
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:229245 [Conf]
 Toshinori Takai, Yuichi Kaji, Hiroyuki Seki
RightLinear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:246260 [Conf]
 Thomas Arts
System Description: The Dependency Pair Method. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:261264 [Conf]
 PierreEtienne Moreau
REM (Reduce Elan Machine): Core of the New ELAN Compiler. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:265269 [Conf]
 Enno Ohlebusch, Claus Claves, Claude Marché
TALP: A Tool for the Termination Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP] RTA, 2000, pp:270273 [Conf]
