Conferences in DBLP
Garrett Birkhoff Term Rewriting and Universal Algebra in Historical Perspective (Abstract of Invited Lecture). [Citation Graph (0, 0)][DBLP ] Conf ] Franz Baader Characterization of Unification Type Zero. [Citation Graph (0, 0)][DBLP ] Conf ] Leo Bachmair Proof Normalization for Resolution and Paramodulation. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy B. Baird , Gerald E. Peterson , Ralph W. Wilkerson Complete Sets of Reductions Modulo Associativity, Commutativity and Identity. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Bertling , Harald Ganzinger Completion-Time Optimization of Rewrite-Time Goal Solving. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhard Bündgen , Wolfgang Küchlin Computing Ground Reducability and Inductively Complete Positions. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon Inductive Proofs by Specification Transformation. [Citation Graph (0, 0)][DBLP ] Conf ] John Darlington , Yike Guo Narrowing and Unification in Functional Programming - An Evaluation Mechanism for Absolute Set Abstraction. [Citation Graph (0, 0)][DBLP ] Conf ] Max Dauchet Simulation of Turning Machines by a Left-Linear Rewrite Rule. [Citation Graph (0, 0)][DBLP ] Conf ] Conal Elliott Higher-order Unification with Dependent Function Types. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen J. Garland , John V. Guttag An Overview of LP, The Larch Power. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Göttler Graph Grammars, A New Paradigma for Implementing Visual Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Hofbauer , Clemens Lautemann Termination Proofs and the Length of Derivations (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Stéphane Kaplan , Christine Choppy Abstract Rewriting with Concrete Operations. [Citation Graph (0, 0)][DBLP ] Conf ] Mike Lai On How To Move Mountains 'Associatively and Commutatively'. [Citation Graph (0, 0)][DBLP ] Conf ] Dallas Lankford Generalized Gröbner Bases: Theory and Applications. A Condensation. [Citation Graph (0, 0)][DBLP ] Conf ] Dana May Latch , Ron Sigal A Local Termination Property for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] George F. McNulty An Equational Logic Sampler. [Citation Graph (0, 0)][DBLP ] Conf ] Aart Middeldorp Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Chilukuri K. Mohan Priority Rewriting: Semantics, Confluence, and Conditional. [Citation Graph (0, 0)][DBLP ] Conf ] Chilukuri K. Mohan , Mandayam K. Srivas Negation with Logical Variables in Conditional Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Tohru Naoi , Yasuyoshi Inagaki Algebraic Semantics and Complexity of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjai Narain Optimization by Non-Deterministic, Lazy Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Nipkow Combining Matching Algorithms: The Rectangular Case. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Otto Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Laurence Puel Embedding with Patterns and Associated Recursive Path Ordering. [Citation Graph (0, 0)][DBLP ] Conf ] Uday S. Reddy Rewriting Techniques for Program Synthesis. [Citation Graph (0, 0)][DBLP ] Conf ] R. C. Sekar , Shaunak Pawagi , I. V. Ramakrishnan Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. [Citation Graph (0, 0)][DBLP ] Conf ] Wayne Snyder Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Steinbach Extensions and Comparison of Simplification Orderings. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Strandh Classes of Equational Programs that Compile into Efficient Machine Code. [Citation Graph (0, 0)][DBLP ] Conf ] Sophie Tison Fair Termination is Decidable for Ground Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshihito Toyama , Jan Willem Klop , Hendrik Pieter Barendregt Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei G. Vorobyov Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction. [Citation Graph (0, 0)][DBLP ] Conf ] Hantao Zhang , Deepak Kapur Consider Only General Superpositions in Completion Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Habib Abdulrab , Jean-Pierre Pécuchet Solving Systems of Linear Diophantine Equations and Word Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Siva Anantharaman , Jieh Hsiang , Jalel Mzali SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Avenhaus , Jörg Denzinger , Jürgen Müller THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Avenhaus , Klaus Madlener , Joachim Steinbach COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Bidoit , Francis Capy , Christine Choppy ASSPEGIQUE: An Integrated Specification Environment. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Paola Bonacina , Giancarlo Sanna KBlab: An Equational Theorem Prover for the Macintosh. [Citation Graph (0, 0)][DBLP ] Conf ] Jim Christian Fast Knuth-Bendix Completion: Summary. [Citation Graph (0, 0)][DBLP ] Conf ] Max Dauchet , Aline Deruyver Compilation of Ground Term Rewriting Systems and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak Kapur , Hantao Zhang An Overview of Rewrite Rule Laboratory (RRL). [Citation Graph (0, 0)][DBLP ] Conf ] Hessam Khoshnevisan , K. M. Sephton InvX: An Automatic Function Inverter. [Citation Graph (0, 0)][DBLP ] Conf ] Naomi Lindenstrauss A Parallel Implementation of Rewriting and Narrowing. [Citation Graph (0, 0)][DBLP ] Conf ] John Pedersen Morphocompletion for One-Relation Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] 