This paper shortly introduces the two logic programming languages Prolog and Mercury. On this background we introduce the problem of analysing termination of programs. Then we present Mercury's termination analyser, that the authors of the language incorporated into its compiler. We will also discuss the proposition based on the same method analyser for Prolog's predicates
AbstractAlthough Prolog is (still) the most widely used logic language, it suffers from a number of ...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
AbstractThis paper presents a formal semantic basis for the termination analysis of logic programs. ...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
The most fundamental decision problem in computer science is the halting problem, i.e., given a desc...
Termination is an important and well-studied property for logic programs. However, almost all approa...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
We provide a theoretical basis for studying termination of (general) logic programs with the Prolog ...
AbstractWe study a powerful class of logic programs which terminate for a large class of goals. Both...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
AbstractWe provide a theoretical basis for studying termination of (general) logic programs with the...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
We present cTI, the first system for universal left-termination inference of logic programs. Termina...
AbstractAlthough Prolog is (still) the most widely used logic language, it suffers from a number of ...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
AbstractIn this paper, we define a framework in which the termination of Prolog programs can be prov...
AbstractThis paper presents a formal semantic basis for the termination analysis of logic programs. ...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
The most fundamental decision problem in computer science is the halting problem, i.e., given a desc...
Termination is an important and well-studied property for logic programs. However, almost all approa...
One of the main advantages of logic programs is that it allows to write declarative programs that ve...
We provide a theoretical basis for studying termination of (general) logic programs with the Prolog ...
AbstractWe study a powerful class of logic programs which terminate for a large class of goals. Both...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
AbstractWe provide a theoretical basis for studying termination of (general) logic programs with the...
Although Prolog is (still) the most widely used logic language, it suffers from a number of drawback...
We present cTI, the first system for universal left-termination inference of logic programs. Termina...
AbstractAlthough Prolog is (still) the most widely used logic language, it suffers from a number of ...
Termination of logic programs with negated body atoms (here called general logic programs) is an imp...
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, ar...
DOI
Add to ORKG