We compare here two uses of negation -- in logic programming and in Prolog. As in Prolog negation is defined by means of meta-programming facilities and the cut operator, this requires a careful reexamination of the assumptions about the underlying syntax and a precise definition of the computational processes involved. After taking care of these matters we establish a formal result showing an equivalence in appropriate sense between these two uses of negation. This result allows us to argue about correctness of various known Prolog programs which use negation by reasoning about the corresponding general logic programs
AbstractNonmonotonic reasoning has been developed to capture common sense inferences. This paper con...
The evolution of Logic Programming semantics has included the introduction of a new explicit form of...
AbstractAlmost all constraint logic programming systems include negation, yet nowhere has a sound op...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractThe notion of negation as inconsistency is motivated and introduced into PROLOG. This negati...
AbstractWe survey here various approaches which were proposed to incorporate negation in logic progr...
The goal of logic programming is that the program, or database, can be understood by logic along, in...
While negation has been a very active área of research in logic programming, comparatively few pape...
We show how a negation operation which allows for the possibility to represent explicit negative inf...
While negation has been a very active área of research in logic programming, comparatively few paper...
In logic programs, negation-as-failure has been used both for representing negative information and ...
The focus of the research is the semantics of logic programming. Concepts in the currently used sem...
AbstractA sound and complete semantics is given for sequential, depth-first logic programming with a...
Negative information can be represented in several classes of logic programs. These approaches were ...
AbstractNegation has traditionally been a difficult issue in Logic Programming. Most of Prolog progr...
AbstractNonmonotonic reasoning has been developed to capture common sense inferences. This paper con...
The evolution of Logic Programming semantics has included the introduction of a new explicit form of...
AbstractAlmost all constraint logic programming systems include negation, yet nowhere has a sound op...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractThe notion of negation as inconsistency is motivated and introduced into PROLOG. This negati...
AbstractWe survey here various approaches which were proposed to incorporate negation in logic progr...
The goal of logic programming is that the program, or database, can be understood by logic along, in...
While negation has been a very active área of research in logic programming, comparatively few pape...
We show how a negation operation which allows for the possibility to represent explicit negative inf...
While negation has been a very active área of research in logic programming, comparatively few paper...
In logic programs, negation-as-failure has been used both for representing negative information and ...
The focus of the research is the semantics of logic programming. Concepts in the currently used sem...
AbstractA sound and complete semantics is given for sequential, depth-first logic programming with a...
Negative information can be represented in several classes of logic programs. These approaches were ...
AbstractNegation has traditionally been a difficult issue in Logic Programming. Most of Prolog progr...
AbstractNonmonotonic reasoning has been developed to capture common sense inferences. This paper con...
The evolution of Logic Programming semantics has included the introduction of a new explicit form of...
AbstractAlmost all constraint logic programming systems include negation, yet nowhere has a sound op...