Add to ORKGIn this paper we present a dataflow analysis method for normal constraint logic programs interpreted with finite failure or constructive negation. We apply our method to a well known analysis for logic programs on the Herbrand Universe: the depth(k) analysis for approximating the set of computed answer constraints. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation
. In this paper we define a new compilative version of constructive negation (intensional negation) ...
AbstractA normal logic program P is transformed to another Pω by a bottom-up computation on the posi...
AbstractImpressive work has been done in the last years concerning the meaning of negation and disju...
In this paper we present a dataflow analysis method for normal logic programs interpreted with negat...
The different properties characterizing the operational behavior of logic programs can be organized ...
AbstractWe show that a simple concurrent pruning mechanism over standard SLD derivation trees, calle...
This paper presents and illustrates a practical approach to the dataflow analysis of constraint logi...
The optimized compilation of Constraint Logic Programming (CLP) languages can give rise to impressiv...
AbstractAlmost all constraint logic programming systems include negation, yet nowhere has a sound op...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
This paper presents and illustrates with an example a practical approach to the dataflow analysis of...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
. In this paper we define a new compilative version of constructive negation (intensional negation) ...
AbstractA normal logic program P is transformed to another Pω by a bottom-up computation on the posi...
AbstractImpressive work has been done in the last years concerning the meaning of negation and disju...
In this paper we present a dataflow analysis method for normal logic programs interpreted with negat...
The different properties characterizing the operational behavior of logic programs can be organized ...
AbstractWe show that a simple concurrent pruning mechanism over standard SLD derivation trees, calle...
This paper presents and illustrates a practical approach to the dataflow analysis of constraint logi...
The optimized compilation of Constraint Logic Programming (CLP) languages can give rise to impressiv...
AbstractAlmost all constraint logic programming systems include negation, yet nowhere has a sound op...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
This paper presents and illustrates with an example a practical approach to the dataflow analysis of...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic program...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
. In this paper we define a new compilative version of constructive negation (intensional negation) ...
AbstractA normal logic program P is transformed to another Pω by a bottom-up computation on the posi...
AbstractImpressive work has been done in the last years concerning the meaning of negation and disju...