Add to ORKGIn this paper we present a dataflow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation
The evolution of Logic Programming semantics has included the introduction of a new explicit form of...
Notions such as "reexecution" and "propagation" have recently attracted attentio...
Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been...
In this paper we present a dataflow analysis method for normal constraint logic programs interpreted...
AbstractA theory of semantics-based dataflow analysis using a notion of “insertion” is presented. Th...
A standard approach to negation in logic programming is negation as failure. Its major drawback is t...
There has recently been an increasing interest in declarative data analysis, where analytic tasks ar...
AbstractThe notions of acyclicity and acceptability fail to characterize termination of general logi...
In logic programs, negation-as-failure has been used both for representing negative information and ...
We give a direct proof of the following theorem: if a goal Gσ is a logical consequence of the partia...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
In this paper, we propose a bottom-up partial evaluation of normal programs with a top-down expansio...
We study termination properties of normal logic programs where negation as failure is interpreted as...
AbstractIn several familiar cases of logic programs and queries with infinitely many answers, the us...
This paper looks at logic programming with three kinds of negation: default, weak and strict negatio...
The evolution of Logic Programming semantics has included the introduction of a new explicit form of...
Notions such as "reexecution" and "propagation" have recently attracted attentio...
Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been...
In this paper we present a dataflow analysis method for normal constraint logic programs interpreted...
AbstractA theory of semantics-based dataflow analysis using a notion of “insertion” is presented. Th...
A standard approach to negation in logic programming is negation as failure. Its major drawback is t...
There has recently been an increasing interest in declarative data analysis, where analytic tasks ar...
AbstractThe notions of acyclicity and acceptability fail to characterize termination of general logi...
In logic programs, negation-as-failure has been used both for representing negative information and ...
We give a direct proof of the following theorem: if a goal Gσ is a logical consequence of the partia...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
In this paper, we propose a bottom-up partial evaluation of normal programs with a top-down expansio...
We study termination properties of normal logic programs where negation as failure is interpreted as...
AbstractIn several familiar cases of logic programs and queries with infinitely many answers, the us...
This paper looks at logic programming with three kinds of negation: default, weak and strict negatio...
The evolution of Logic Programming semantics has included the introduction of a new explicit form of...
Notions such as "reexecution" and "propagation" have recently attracted attentio...
Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been...