This report gives an outline of the theoretical and practical framework for the implementation of a restricted form of residual SLDNF in languages falling under the genral CLP scheme ([JLM86]). The work is related to partial evaluation of goals in logic programs and to constructive negation ([Cha88]). In particular we implement constructive negation for arithmetic relations in the domain of real numbers under CLP(R)
This paper presents a new, powerful evaluation strategy (OLDTC-AM) for CLP programs. OLDTCAM is deve...
AbstractThis paper is concerned with the axiomatization of success and failure in propositional logi...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...
AbstractAlmost all constraint logic programming systems include negation, yet nowhere has a sound op...
AbstractWe show that a simple concurrent pruning mechanism over standard SLD derivation trees, calle...
AbstractThe notions of acyclicity and acceptability fail to characterize termination of general logi...
The aim of this paper is to extend the Constructive Negation technique to the case of CLP(SET), a Co...
We consider a mode of an n-ary predicate symbol with respect to a logic program, which meets the aim...
. In this paper we define a new compilative version of constructive negation (intensional negation) ...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
We consider propositional logic programs with negations. We define notions of constructive transform...
In this paper we present a dataflow analysis method for normal constraint logic programs interpreted...
AbstractThe SLDNF resolution (SLD resolution with negation as failure) is often restricted to yield ...
We give a direct proof of the following theorem: if a goal Gσ is a logical consequence of the partia...
AbstractSLDNF-resolution is a standard operational semantics for negation as (finite) failure. For s...
This paper presents a new, powerful evaluation strategy (OLDTC-AM) for CLP programs. OLDTCAM is deve...
AbstractThis paper is concerned with the axiomatization of success and failure in propositional logi...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...
AbstractAlmost all constraint logic programming systems include negation, yet nowhere has a sound op...
AbstractWe show that a simple concurrent pruning mechanism over standard SLD derivation trees, calle...
AbstractThe notions of acyclicity and acceptability fail to characterize termination of general logi...
The aim of this paper is to extend the Constructive Negation technique to the case of CLP(SET), a Co...
We consider a mode of an n-ary predicate symbol with respect to a logic program, which meets the aim...
. In this paper we define a new compilative version of constructive negation (intensional negation) ...
The proof theory of logic programming has been given by the SLDNF-resolution which has been proven c...
We consider propositional logic programs with negations. We define notions of constructive transform...
In this paper we present a dataflow analysis method for normal constraint logic programs interpreted...
AbstractThe SLDNF resolution (SLD resolution with negation as failure) is often restricted to yield ...
We give a direct proof of the following theorem: if a goal Gσ is a logical consequence of the partia...
AbstractSLDNF-resolution is a standard operational semantics for negation as (finite) failure. For s...
This paper presents a new, powerful evaluation strategy (OLDTC-AM) for CLP programs. OLDTCAM is deve...
AbstractThis paper is concerned with the axiomatization of success and failure in propositional logi...
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present a...