[PDF][PDF] The stable model semantics for logic programming.
M Gelfond, V Lifschitz�- ICLP/SLP, 1988 - cse.unsw.edu.au
… We propose a new declarative semantics for logic programs with negation. Its formulation is
quite simple; at the same time, it is more general than the iterated fixed point … is true in Mi,
observe that R is true in Mi (because Mi is a model of П), that every negative literal ->B in the
body of R is true in Mi (because В ^ M and Mi С M), and that R' can be obtained by resolving R
against these literals. Since … The query evaluation procedure of PROLOG handles program
(5) correctly relative to the stable model semantics: For every query without variables, it�…
quite simple; at the same time, it is more general than the iterated fixed point … is true in Mi,
observe that R is true in Mi (because Mi is a model of П), that every negative literal ->B in the
body of R is true in Mi (because В ^ M and Mi С M), and that R' can be obtained by resolving R
against these literals. Since … The query evaluation procedure of PROLOG handles program
(5) correctly relative to the stable model semantics: For every query without variables, it�…
Showing the best result for this search. See all results