Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools
Maximal completion (Klein and Hirokawa 2011) is an elegantly simple yet powerful variant of Knuth-Be...
AbstractThis paper describes REVEUR-3, a software that implements a general completion procedure. RE...
We first show that ground term-rewriting systems can be completed in apolynomial number of rewriting...
Given an equational system, completion procedures compute an equivalent and complete (terminating an...
In equational theorem proving, convergent term rewriting systems play a crucial role. In order to co...
Unfailing completion is a commonly used technique for equational reasoning. For equational problems ...
Projet EURECAThis paper presents a completion procedure for proving termination of term rewrite syst...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractFor a complete, i.e., confluent and terminating term rewriting system (TRS) it is well-known...
Paru dans : Resolution of equations in algebraic structures/H.Ait-Kaci et M.Nivat ed., pages 141-170...
Solving the word problem requires to decide whether an equation s ≈ t follows from an equa-tional sy...
In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is n...
AbstractWe describe and prove completion procedures for equational term rewriting systems in order-s...
The Knuth-Bendix completion procedure can be used to transform an equational system into a convergen...
AbstractInfinite sets of rewrite rules may be generated for example by completion of term-rewriting ...
Maximal completion (Klein and Hirokawa 2011) is an elegantly simple yet powerful variant of Knuth-Be...
AbstractThis paper describes REVEUR-3, a software that implements a general completion procedure. RE...
We first show that ground term-rewriting systems can be completed in apolynomial number of rewriting...
Given an equational system, completion procedures compute an equivalent and complete (terminating an...
In equational theorem proving, convergent term rewriting systems play a crucial role. In order to co...
Unfailing completion is a commonly used technique for equational reasoning. For equational problems ...
Projet EURECAThis paper presents a completion procedure for proving termination of term rewrite syst...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractFor a complete, i.e., confluent and terminating term rewriting system (TRS) it is well-known...
Paru dans : Resolution of equations in algebraic structures/H.Ait-Kaci et M.Nivat ed., pages 141-170...
Solving the word problem requires to decide whether an equation s ≈ t follows from an equa-tional sy...
In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is n...
AbstractWe describe and prove completion procedures for equational term rewriting systems in order-s...
The Knuth-Bendix completion procedure can be used to transform an equational system into a convergen...
AbstractInfinite sets of rewrite rules may be generated for example by completion of term-rewriting ...
Maximal completion (Klein and Hirokawa 2011) is an elegantly simple yet powerful variant of Knuth-Be...
AbstractThis paper describes REVEUR-3, a software that implements a general completion procedure. RE...
We first show that ground term-rewriting systems can be completed in apolynomial number of rewriting...
DOI
Add to ORKG