Gelfond M., Lifschitz, V., 1990. Logic Programming with Classical Negation. Seventh Intl. Conf. of Logic Programming. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Updates, Induction and Abduction in Deductive Databases - Vrain, Laurent (2 citations) (Correct)
....2 We note that, in our model, two kinds of negation are present: negation in update rules, which corresponds to classical negation, and negation in query rules, which corresponds to the negation of the well founded semantics. In this respect, we make the following assumption, in the spirit of [2, 7]: for every atom A if :A is derived through the update rules, then :A still holds with respect to the query rules. We refer to [8] for more details on this topic. 5 What is important to note with respect to negation is that update rules can be seen as way to perform abduction and that the ....
Gelfond M., Lifschitz, V., 1990. Logic Programming with Classical Negation. Seventh Intl. Conf. of Logic Programming.
A theory of nonmonotonic rule systems I - Marek, Nerode, Remmel (1990) (12 citations) (Correct)
....to so called supported models of P . cf. Apt [ Apt, 1988 ] Proposition 4.3 A subset M U is a supported model of P if and only if M is a weak extension of tr(P ) 4. 7 Logic programming with classical negation We now discuss the so called logic programming with classical negation of [ Gelfond and Lifschitz, 1989] as a chapter in the theory of nonmonotonic formal systems. Recall the basic notions introduced in [Gelfond and Lifschitz, 1989] The collection of objects appearing in heads or bodies of clauses is the set of all literals, that is, atoms or negated atoms. In particular, a negated atom may appear ....
....and only if M is a weak extension of tr(P ) 4.7 Logic programming with classical negation We now discuss the so called logic programming with classical negation of [ Gelfond and Lifschitz, 1989] as a chapter in the theory of nonmonotonic formal systems. Recall the basic notions introduced in [Gelfond and Lifschitz, 1989]. The collection of objects appearing in heads or bodies of clauses is the set of all literals, that is, atoms or negated atoms. In particular, a negated atom may appear in the head of a clause. Consider first general Horn clauses in which literals may appear in arbitrary places. To each set P ....
[Article contains additional citation context not shown here]
M. Gelfond, V. Lifschitz. Logic Programming with Classical Negation. Unpublished Manuscript.
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