AbstractThis paper describes the actual implementation in the rewrite rule laboratory REVE of an elementary procedure that checks inequalities between polynomials and is used for proving termination of rewriting systems, especially in the more difficult case of associative-commutative rewriting systems, for which a complete characterization is given
This paper introduces a new technique for termination analysis of definite logic programs (LPs) base...
We give an overview of some combinatorial problems that can be transformed to termination problems o...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
AbstractThis paper describes the actual implementation in the rewrite rule laboratory REVE of an ele...
Abstract. This paper describes the actual implementation in the rewrite rule laboratory REVE of an e...
The aim of the work described in this paper is to formalize in the proof assistant \coq the polynomi...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
Abstract. We focus on termination proofs of rewrite systems, especially of rewrite systems containin...
Orderings on polynomial interpretations of operators represent a powerful technique for proving thet...
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpr...
Abstract. Polynomial interpretations are a useful technique for proving termination of term rewrite ...
AbstractSymbolic constraints arising in proofs of termination of programs are often translated into ...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. W...
This paper introduces a new technique for termination analysis of definite logic programs (LPs) base...
We give an overview of some combinatorial problems that can be transformed to termination problems o...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
AbstractThis paper describes the actual implementation in the rewrite rule laboratory REVE of an ele...
Abstract. This paper describes the actual implementation in the rewrite rule laboratory REVE of an e...
The aim of the work described in this paper is to formalize in the proof assistant \coq the polynomi...
SIGLECNRS 14802 E / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
Abstract. We focus on termination proofs of rewrite systems, especially of rewrite systems containin...
Orderings on polynomial interpretations of operators represent a powerful technique for proving thet...
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpr...
Abstract. Polynomial interpretations are a useful technique for proving termination of term rewrite ...
AbstractSymbolic constraints arising in proofs of termination of programs are often translated into ...
In this paper we give an introduction to term rewriting and termination. Moreover, we sketch some de...
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. W...
This paper introduces a new technique for termination analysis of definite logic programs (LPs) base...
We give an overview of some combinatorial problems that can be transformed to termination problems o...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
DOI
Add to ORKG