AbstractIn this paper, we define a framework in which the termination of Prolog programs can be proved. This framework relies on a semantics of Prolog that takes Prolog's control into account. A major asset of the method is that it makes the proof of termination (and other) properties of Prolog programs possible within a classical first-order logic setting
The most fundamental decision problem in computer science is the halting problem, i.e., given a desc...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
In this paper, we present a termination preserving transformation of CHR to Prolog. This allows the ...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
AbstractWe provide a theoretical basis for studying termination of (general) logic programs with the...
We provide a theoretical basis for studying termination of (general) logic programs with the Prolog ...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
We study the termination properties of well-moded programs, and we show that, under suitable conditi...
AbstractThis paper presents a formal semantic basis for the termination analysis of logic programs. ...
A methodology for proving the termination of well-moded logic programs is developed by reducing the ...
AbstractA methodology for proving the termination of well-moded logic programs is developed by reduc...
Termination is an important and well-studied property for logic programs. However, almost all approa...
AbstractIn this paper semi-linear norms, a class of functions to weight the terms occurring in a pro...
AbstractWe study a powerful class of logic programs which terminate for a large class of goals. Both...
This paper shortly introduces the two logic programming languages Prolog and Mercury. On this backgr...
The most fundamental decision problem in computer science is the halting problem, i.e., given a desc...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
In this paper, we present a termination preserving transformation of CHR to Prolog. This allows the ...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
AbstractWe provide a theoretical basis for studying termination of (general) logic programs with the...
We provide a theoretical basis for studying termination of (general) logic programs with the Prolog ...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
We study the termination properties of well-moded programs, and we show that, under suitable conditi...
AbstractThis paper presents a formal semantic basis for the termination analysis of logic programs. ...
A methodology for proving the termination of well-moded logic programs is developed by reducing the ...
AbstractA methodology for proving the termination of well-moded logic programs is developed by reduc...
Termination is an important and well-studied property for logic programs. However, almost all approa...
AbstractIn this paper semi-linear norms, a class of functions to weight the terms occurring in a pro...
AbstractWe study a powerful class of logic programs which terminate for a large class of goals. Both...
This paper shortly introduces the two logic programming languages Prolog and Mercury. On this backgr...
The most fundamental decision problem in computer science is the halting problem, i.e., given a desc...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
In this paper, we present a termination preserving transformation of CHR to Prolog. This allows the ...
DOI
Add to ORKG