Normalised Rewriting and Normalised Completion (1994)

Cached

Download Links

by Claude Marche
Citations:19 - 2 self

Documents Related by Co-Citation

136 Complete sets of reductions for some equational theories – G E Peterson, M E Stickel - 1981
146 Completion of a set of rules modulo a set of equations – J-P Jouannaud, H Kirchner - 1986
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
364 Confluent reductions: Abstract properties and applications to term rewriting systems – G Huet - 1980
492 Simple word problems in universal algebras – D E Knuth, P B Bendix - 1970
266 Orderings for term rewriting systems – N Dershowitz - 1982
199 Rewrite-based equational theorem proving with selection and simplification – L Bachmair, H Ganzinger - 1994
38 P.: Canonical forms in finitely presented algebras – Le Chenadec - 1986
454 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001
36 Decision procedures for simple equational theories with permutative axioms: Complete sets of permutative reductions – D S Lankford, A M Ballantyne - 1977
74 Theorem Proving with Ordering and Equality Constrained Clauses – Robert Nieuwenhuis, Albert Rubio - 1995
11 Termination and Completion modulo Associativity, Commutativity and Identity – Jean-pierre Jouannaud, Claude Marché - 1992
67 Deduction with symbolic constraints. Revue Francaise d’Intelligence Artificielle – C Kirchner, H Kirchner, M Rusinowitch - 1990
68 Basic Paramodulation – Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder - 1995
110 Building in Equational Theories – G Plotkin - 1972
63 Higher-order rewrite systems and their confluence – Richard Mayr - 1998
9 editors. Term Rewriting Systems – M Bezem, J Klop, R Vrijer - 2003
15 On ground AC-completion – C Marché - 1991
216 Unification Theory – Franz Baader, Wayne Snyder - 2001