General logic programs and Stable model Question. Can anyone help me?


Q(1)Given a propositional general logic program P and an atom A,
suppose we transform P to a new program P' in this way: (i) delete each
rule that has A as its
head; (ii) delete each (non-negated) occurrence of A in the bodies of
rules. How
are the stable models (if any) if P related to those of of P' ? (If
possible, also
prove your statement formally.)


Q(2) Recode the default logic below (given in the slides) as an
extended logic program
(i.e. one that has both negation-as-failure and classical negation)
dropout(bill)
dropout(X) : adult(X)/adult(X)
adult(X) : employed(X)/employed(X)
dropout(X) : ¬employed(X)/¬employed(X)

What is its answer set???

.