A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on reexecution. The concrete and abstract semantics express both deadlock information and qualified answers
Residuation is an operational mechanism for the integration of functions into logic programming lang...
AbstractResiduation is an operational mechanism for the integration of functions into logic programm...
The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling ru...
A general semantics-based framework for the analysis of logic programs with delay declarations is pr...
A general semantics-based framework for the analysis of logic programs with delay declarations is p...
We draw concrete and abstract operational semantics towards the analysis of logic programs with dela...
AbstractWe draw concrete and abstract operational semantics towards the analysis of logic programs w...
Abstract. A domain for the abstract interpretation of logic programs with delay declarations is pres...
Abstract. The paper focuses on practical analyses for logic programs with de-lay. The method describ...
. Logic programs augmented with delay declarations form a higly expressive programming language in w...
In this paper we propose a method for proving termination of logic programs with delay declarations....
textabstractIn this paper we propose a method for proving termination of logic programs with delay d...
This paper focusses on practical analysis for logic programs with delay. The method described is for...
We show how logic programs with “delays ” can be transformed to programs without delays in a way whi...
We show how termination of logic programs with delay declarations can be proven. Three features are ...
Residuation is an operational mechanism for the integration of functions into logic programming lang...
AbstractResiduation is an operational mechanism for the integration of functions into logic programm...
The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling ru...
A general semantics-based framework for the analysis of logic programs with delay declarations is pr...
A general semantics-based framework for the analysis of logic programs with delay declarations is p...
We draw concrete and abstract operational semantics towards the analysis of logic programs with dela...
AbstractWe draw concrete and abstract operational semantics towards the analysis of logic programs w...
Abstract. A domain for the abstract interpretation of logic programs with delay declarations is pres...
Abstract. The paper focuses on practical analyses for logic programs with de-lay. The method describ...
. Logic programs augmented with delay declarations form a higly expressive programming language in w...
In this paper we propose a method for proving termination of logic programs with delay declarations....
textabstractIn this paper we propose a method for proving termination of logic programs with delay d...
This paper focusses on practical analysis for logic programs with delay. The method described is for...
We show how logic programs with “delays ” can be transformed to programs without delays in a way whi...
We show how termination of logic programs with delay declarations can be proven. Three features are ...
Residuation is an operational mechanism for the integration of functions into logic programming lang...
AbstractResiduation is an operational mechanism for the integration of functions into logic programm...
The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling ru...
DOI
Add to ORKG