Solving II

Question 1

The Sets of the completion nogoods and the loop nogoods are the (Deterministic) propagation inside CDNL-ASP(P)

Answer 1

FALSE

Question 2

If a Normal Program P is “tight”, then the sets of completion nogoods and the completion nogoods unioned with the loop nogoods have the same solutions.

Answer 2

This is true, it is someones thereom.

Question 3

if a normal program P has no stable models, then CDNL-ASP(P) is not guaranteed to terminate.

Answer 3

False. It will.

Question 4

For the following normal logic program P, fing the sets of completion nogoods.
What is the nogood containing Tc
C <- -b, -d

Answer 4

Tc,F(-b,-d)

Question 5

For any normal logic program P. How big is the set of completion nogoods.

Answer 5

it is k+1 head atoms. and k+1 head atoms * k + 1 body literals.

Question 6

What is the number of loop nogoods if there is a loop?

Answer 6

a generic rule would be k+1 per atom?