Conferences in DBLP
Richard Kennaway , Jan Willem Klop , M. Ronan Sleep , Fer-Jan de Vries Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] William M. Farmer , Ronald J. Watro Redex Capturing in Term Graph Rewriting (Concise Version). [Citation Graph (0, 0)][DBLP ] Conf ] David A. Wolfram Rewriting, and Equational Unification: the Higher-Order Cases. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel J. Dougherty Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Frank Drewes , Clemens Lautemann Incremental Termination Proofs and the Length of Derivations. [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Hofbauer Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Krischer , Alexander Bockmayr Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Baader Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Domenjoud AC Unification Through Order-Sorted AC1 Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Chabin , Pierre Réty Narrowing Directed by a Graph of Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Baader , Werner Nutt Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Klay Undecidable Properties of Syntactic Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Wayne Snyder , Christopher Lynch Goal Directed Strategies for Paramodulation. [Citation Graph (0, 0)][DBLP ] Conf ] Loic Pottier Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Hélène Kirchner Proofs in Parameterized Specification. [Citation Graph (0, 0)][DBLP ] Conf ] Aart Middeldorp , Yoshihito Toyama Completeness of Combinations of Constructor Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Nipkow , Zhenyu Qian Modular Higher-Order E -Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre-Louis Curien , Giorgio Ghelli On Confluence for Weakly Normalizing Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Françoise Bellegarde Program Transformation and Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Dave Cohen , Phil Watson An Efficient Representation of Arithmetic for Term Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Sieger van Denneheuvel , Karen L. Kwast , Gerard R. Renardel de Lavalette , Edith Spaan Query Optimization Using Rewrite Rules. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Socher-Ambrosius Boolean Algebra Admits No Convergent Term Rewriting System. [Citation Graph (0, 0)][DBLP ] Conf ] Kai Salomaa Decidability of Confluence and Termination of Monadic Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Luc Coquidé , Max Dauchet , Rémi Gilleron , Sándor Vágvölgyi Bottom-Up Tree Pushdown Automata and Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory Kucherov On Relationship Between Term Rewriting Systems and Regular Tree Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Franz-Josef Brandenburg The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Gräf Left-to-Right Tree Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ramesh , I. V. Ramakrishnan Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Paola Bonacina , Jieh Hsiang On Fairness of Completion-Based Theorem Proving Strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Avenhaus Proving Equational and Inductive Theorems by Completion and Embedding Techniques. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Sattler-Klein Divergence Phenomena during Completion. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhard Bündgen Simulation Buchberger's Algorithm by Knuth-Bendix Completion. [Citation Graph (0, 0)][DBLP ] Conf ] Miki Hermann On Proving Properties of Completion Strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Claude Marché On Ground AC-Completion. [Citation Graph (0, 0)][DBLP ] Conf ] Paliath Narendran , Michaël Rusinowitch Any Gound Associative-Commutative Theory Has a Finite Canonical System. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Fraus A Narrowing-Based Theorem Prover. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Billaud ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with Priorities. [Citation Graph (0, 0)][DBLP ] Conf ] Aline Deruyver EMMY: A Refutational Theorem Prover for First-Order Logic with Equation. [Citation Graph (0, 0)][DBLP ] Conf ] Raj Agarwal , David R. Musser , Deepak Kapur , Xumin Nie The Tecton Proof System. [Citation Graph (0, 0)][DBLP ] Conf ] Nachum Dershowitz , Jean-Pierre Jouannaud , Jan Willem Klop Open Problems in Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] 