Logic programs with classical negation
Citations
2,451 citations
Cites background from "Logic programs with classical negat..."
...(Section 2), this rule is obtained from a rule ( 7 ) of II by deleting not Lm+l ........
[...]
...( i ) for any ground instance ( 7 ) of any default from D, if G ~ FD(E) and //1 ........
[...]
...*** In the notation of Ref. 25), ( 7 ) would be written as...
[...]
967 citations
Cites background from "Logic programs with classical negat..."
...Furthermore, logic program rules can be seen as default rules in Reiter’s default logic [31] and then stable models correspond to default extensions [18]....
[...]
878 citations
Cites background or methods from "Logic programs with classical negat..."
...Strong negation was introduced in Extended Logic Programming (Gelfond & Lifschitz, 1990)....
[...]
...The change reflects that when an extended literal is found in the body of a rule, that literal will be ignored: 4 Adapted from an example attributed to John McCarthy in (Gelfond & Lifschitz, 1990)....
[...]
...If a contradictory set Π is used in a de.l.p. then the answer would be Lit , as in Extended Logic Programming....
[...]
...In (Gelfond & Lifschitz, 1990), Logic Programming with Classical Negation was introduced....
[...]
...This problem was attacked in (Inoue, 1991), where Extended Logic Programming with Default Assumptions is considered....
[...]
687 citations
565 citations