Conferences in DBLP
Robert Nieuwenhuis , José Miguel Rivero Solved Forms for Path Ordering Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Nachum Dershowitz , Subrata Mitra Jeopardy. [Citation Graph (0, 0)][DBLP ] Conf ] Eelco Visser Strategic Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe de Groote On the Strong Normalisation of Natural Deduction with Permutation-Conversions. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent van Oostrom Normalisation in Weakly Orthogonal Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Di Cosmo , Stefano Guerrini Strong Normalization of Proof Nets Modulo Structural Congruences. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Marcinkowski Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol. [Citation Graph (0, 0)][DBLP ] Conf ] Anne-Cécile Caron , Franck Seynhaeve , Sophie Tison , Marc Tommasi Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Sébastien Limet , Pierre Réty A New Result about the Decidability of the Existential One-Step Rewriting Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Rubio A Fully Syntactic AC-RPO. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Stuber Theory Path Orderings. [Citation Graph (0, 0)][DBLP ] Conf ] Hélène Touzet A Characterisation of Multiply Recursive Functions with Higman's Lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Baader , Cesare Tinelli Deciding the Word Problem in the Union of Equational Theories Sharing Constructors. [Citation Graph (0, 0)][DBLP ] Conf ] Leo Bachmair , C. R. Ramakrishnan , I. V. Ramakrishnan , Ashish Tiwari Normalization via Rewrite Closures. [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Hofbauer , Maria Huber Test Sets for the Universal and Existential Closure of Regular Tree Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Femke van Raamsdonk Higher-Order Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Clavel , Francisco Durán , Steven Eker , Patrick Lincoln , Narciso Martí-Oliet , José Meseguer , Jose F. Quesada The Maude System. [Citation Graph (0, 0)][DBLP ] Conf ] Francisco Javier López-Fraguas , Jaime Sánchez-Hernández TOY : A Multiparadigm Declarative System.Citation Graph (0, 0)][DBLP ] Conf ] Stephan Kepser , Jörn Richts UNIMOK: A System for Combining Equational Unification Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Rakesh M. Verma , Shalitha Senanayake Larrow R2 : A Laboratory fro Rapid Term Graph Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Takashi Nagaya , Yoshihito Toyama Decidability for Left-Linaer Growing Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Giesl , Aart Middeldorp Transforming Context-Sensitive Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Maria C. F. Ferreira , A. L. Ribeiro Context-Sensitive AC-Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada The Calculus of algebraic Constructions. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Dowek , Thérèse Hardin , Claude Kirchner HOL-lambdasigma : An Intentional First-Order Expression of Higher-Order Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Otto On the Connections between Rewriting and Formal Language Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Christiane Frougny , Jacques Sakarovitch A Rewrite System Associated with Quadratic Pisot Units. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Göbel Fast Rewriting of Symmetric Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Saubion , Igor Stéphan On Implementation of Tree Synchronized Languages. [Citation Graph (0, 0)][DBLP ] Conf ] 