This paper reports on work that was done in a project called "Termination analysis: crossing paradigm borders". The aim of the project is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we report on part of the results of this project, namely, the study of porting termination analysis techniques based on polynomial interpretation - very well known in the context of term rewrite systems (TRS) - to obtain new (non-transformational) termination analysis techniques for definite logic programs (LP). We show how this leads to an approach that can be seen as a direct generalization of the traditional techniques in termination analysis of LP, where linear...
This article makes two contributions to the work on semantics-based termination analysis for logic p...
We present a new approach to termination analysis of logic programs. The essence of the approach is ...
Abstract. We propose a new constraint-based approach to termination analysis, applicable to Logic Pr...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
This paper introduces a new technique for termination analysis of definite logic programs (LPs) base...
There are two kinds of approaches for termination analysis of logic programs: "transformational" and...
Current norm-based automatic termination analysis techniques for logic programs can be split up into...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
We present a new approach to termination analysis of logic programs. The essence of the approach is ...
The aim of the work described in this paper is to formalize in the proof assistant \coq the polynomi...
This paper introduces a modular framework for termination analysis of logic programming. To this end...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
Abstract. Polynomial interpretations are one of the most popular techniques for automated terminatio...
This paper makes two contributions to the work on semantics based termination analysis for logic pro...
This article makes two contributions to the work on semantics-based termination analysis for logic p...
We present a new approach to termination analysis of logic programs. The essence of the approach is ...
Abstract. We propose a new constraint-based approach to termination analysis, applicable to Logic Pr...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
Our goal is to study the feasibility of porting termination analysis techniques developed for one pr...
This paper introduces a new technique for termination analysis of definite logic programs (LPs) base...
There are two kinds of approaches for termination analysis of logic programs: "transformational" and...
Current norm-based automatic termination analysis techniques for logic programs can be split up into...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
We present a new approach to termination analysis of logic programs. The essence of the approach is ...
The aim of the work described in this paper is to formalize in the proof assistant \coq the polynomi...
This paper introduces a modular framework for termination analysis of logic programming. To this end...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
Abstract. Polynomial interpretations are one of the most popular techniques for automated terminatio...
This paper makes two contributions to the work on semantics based termination analysis for logic pro...
This article makes two contributions to the work on semantics-based termination analysis for logic p...
We present a new approach to termination analysis of logic programs. The essence of the approach is ...
Abstract. We propose a new constraint-based approach to termination analysis, applicable to Logic Pr...