A completion procedure for globally finite term rewriting systems

A Parallel Completion Procedure for Term Rewriting Systems

Katherine A. Yelick
Stephen J. Garland

January 1992

We present a parallel completion procedure for term rewriting systems. Despite an extensive literatu...

Completeness of Combinations of Constructor Systems

Middeldorp, Aart
Toyama, Yoshihito

March 1993

AbstractA term rewriting system is called complete if it is both confluent and strongly normalising....

On deciding the confluence of a finite string-rewriting system on a given congruence class

Otto, F.
Kaiserslautern Univ. (Germany). Fachbereich Informatik

January 1986

SIGLETIB: RN 7281 (159) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

Finite complete rewriting systems and the complexity of the word problem

Bauer, G.
Otto, F.
Kaiserslautern Univ. (Germany, F.R.). Fachbereich Informatik

January 1984

Some of the results presented here are from the doctoral dissertation of the first author, which was...

Proving the correctness of a code generator specification using term rewriting techniques

Buth, K.H.
Wenzel, B.
Kiel Univ. (Germany). Inst. fuer Informatik und Praktische Mathematik

January 1987

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Maximal Completion

Klein, Dominik
Hirokawa, Nao

April 2011

Given an equational system, completion procedures compute an equivalent and complete (terminating an...

Termination by completion

Bellegarde, François
Lescanne, Pierre

January 1990

Projet EURECAThis paper presents a completion procedure for proving termination of term rewrite syst...

Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems

Dauchet, Max
Heuillard, Thierry
Tison, Sophie
Lescanne, Pierre
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1990

Paru dans Information and computation, 88(2) : p.187-201, 1990. <8341>SIGLEAvailable at INIST ...

Constraint-Based Multi-Completion Procedures for Term Rewriting Systems

Sato, Haruhiko
Kurihara, Masahito
Winkler, Sarah
Middeldorp, Aart

February 2009

In equational theorem proving, convergent term rewriting systems play a crucial role. In order to co...

String rewriting systems and associated finiteness conditions

McGlashan, S.

January 2002

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN050752 / BLDSC - British Library D...

Completion algorithms for conditional rewriting systems

Kaplan, Stephane
Remy, Jean-Luc
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1989

Paru dans : Resolution of equations in algebraic structures/H.Ait-Kaci et M.Nivat ed., pages 141-170...

Schematization of infinite sets of rewrite rules applications to the divergence of completion processes

Kirchner, Helene
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Vandoeuvre-les-Nancy (France). Unite de Recherche de Lorraine

January 1987

SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

El algoritmo de compleción de Knuth-Bendix

Balcázar Navarro, José Luis

January 1988

An introduction to the confluence and finite termination properties of rewriting systems is presente...

Using string-rewriting for solving the word problem for finitely presented groups

Otto, F.
Madlener, K.
Kaiserslautern Univ. (Germany). Fachbereich Informatik

January 1986

Copy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruh...

Transforming infinite rewrite systems into finite rewrite systems by embedding techniques

Avenhaus, Jürgen

January 1989

The Knuth-Bendix completion procedure can be used to transform an equational system into a convergen...

A Parallel Completion Procedure for Term Rewriting Systems

Katherine A. Yelick
Stephen J. Garland

January 1992

We present a parallel completion procedure for term rewriting systems. Despite an extensive literatu...

Completeness of Combinations of Constructor Systems

Middeldorp, Aart
Toyama, Yoshihito

March 1993

AbstractA term rewriting system is called complete if it is both confluent and strongly normalising....

On deciding the confluence of a finite string-rewriting system on a given congruence class

Otto, F.
Kaiserslautern Univ. (Germany). Fachbereich Informatik

January 1986

SIGLETIB: RN 7281 (159) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

Finite complete rewriting systems and the complexity of the word problem

Bauer, G.
Otto, F.
Kaiserslautern Univ. (Germany, F.R.). Fachbereich Informatik

January 1984

Some of the results presented here are from the doctoral dissertation of the first author, which was...

Proving the correctness of a code generator specification using term rewriting techniques

Buth, K.H.
Wenzel, B.
Kiel Univ. (Germany). Inst. fuer Informatik und Praktische Mathematik

January 1987

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Maximal Completion

Klein, Dominik
Hirokawa, Nao

April 2011

Given an equational system, completion procedures compute an equivalent and complete (terminating an...

Termination by completion

Bellegarde, François
Lescanne, Pierre

January 1990

Projet EURECAThis paper presents a completion procedure for proving termination of term rewrite syst...

Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems

Dauchet, Max
Heuillard, Thierry
Tison, Sophie
Lescanne, Pierre
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1990

Paru dans Information and computation, 88(2) : p.187-201, 1990. <8341>SIGLEAvailable at INIST ...

Constraint-Based Multi-Completion Procedures for Term Rewriting Systems

Sato, Haruhiko
Kurihara, Masahito
Winkler, Sarah
Middeldorp, Aart

February 2009

In equational theorem proving, convergent term rewriting systems play a crucial role. In order to co...

String rewriting systems and associated finiteness conditions

McGlashan, S.

January 2002

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN050752 / BLDSC - British Library D...

Completion algorithms for conditional rewriting systems

Kaplan, Stephane
Remy, Jean-Luc
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1989

Paru dans : Resolution of equations in algebraic structures/H.Ait-Kaci et M.Nivat ed., pages 141-170...

Schematization of infinite sets of rewrite rules applications to the divergence of completion processes

Kirchner, Helene
Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Vandoeuvre-les-Nancy (France). Unite de Recherche de Lorraine

January 1987

SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

El algoritmo de compleción de Knuth-Bendix

Balcázar Navarro, José Luis

January 1988

An introduction to the confluence and finite termination properties of rewriting systems is presente...

Using string-rewriting for solving the word problem for finitely presented groups

Otto, F.
Madlener, K.
Kaiserslautern Univ. (Germany). Fachbereich Informatik

January 1986

Copy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruh...

Transforming infinite rewrite systems into finite rewrite systems by embedding techniques

Avenhaus, Jürgen

January 1989

The Knuth-Bendix completion procedure can be used to transform an equational system into a convergen...

A Parallel Completion Procedure for Term Rewriting Systems

Katherine A. Yelick
Stephen J. Garland

January 1992

We present a parallel completion procedure for term rewriting systems. Despite an extensive literatu...

Completeness of Combinations of Constructor Systems

Middeldorp, Aart
Toyama, Yoshihito

March 1993

AbstractA term rewriting system is called complete if it is both confluent and strongly normalising....

On deciding the confluence of a finite string-rewriting system on a given congruence class

Otto, F.
Kaiserslautern Univ. (Germany). Fachbereich Informatik

January 1986

SIGLETIB: RN 7281 (159) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

A completion procedure for globally finite term rewriting systems

Abstract

Extracted data

A completion procedure for globally finite term rewriting systems

Abstract

Extracted data

Related items

Related items