3 citations found. Retrieving documents...
Przymusinsky, T. C., On Constructive Negation in Logic Programming, Extended Abstract, 1991

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Constructive Negation in CLP(H) - Bartak   (Correct)

....see Section 6) To avoid such non intuitive behaviour and to keep the declarative character of logic programs we shift our attention to the constructive negation which promises to handle even the non ground negative goals correctly. However, neither the pioneering works on constructive negation [21,26] nor the recent works on CLP [6,11,13] provide enough details to a successful implementation of the concept of constructive negation. 3 Equality and disequality solver We choose the CLP(H) where H is the Herbrand Universe with equality and disequality constraints, as a natural framework for ....

Przymusinsky, T. C., On Constructive Negation in Logic Programming, Extended Abstract, 1991


A Bottom-up Semantics for Constructive Negation - Bossi, Fabris, Meo (1994)   (4 citations)  (Correct)

....negation. We shall give the intuition that [ P ] CN captures and models computational features (like termination properties or answer substitutions as in [8, 1] of some operational semantics for constructive negation recently proposed. First we consider the operational semantics defined in [5, 22]. These semantics exploit a generalization to normal programs of the following idea: in a definite program, if the atomic query A has a finite set of answers ffi 1 ; ffi n then A ffi 1 : ffi n is a consequence of Clark s completion. Thus also :A :ffi 1 : ffi n is a ....

T. Przymusinsky. On Constructive Negation in Logic Programming. In Proc. North American Conference on Logic Programming, Addendum. MIT Press, 1989.


Constructive Negation and Constraints - Bartak (1998)   (Correct)

....see Section 5) To avoid such non intuitive behaviour and to keep the declarative character of logic programs we shift our attention to the constructive negation which promises to handle even the non ground negative goals correctly. However, neither the pioneering works on constructive negation [11,12] nor the recent works on CLP [3,6] provide enough details to a successful implementation of the concept of constructive negation. 3 Constraint Solving over the Herbrand Universe The traditional drawback of logic programms and Prolog is that they cannot handle negative information in a ....

Przymusinsky, T. C., On Constructive Negation in Logic Programming, Extended Abstract, 1991

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC