Weak generalized closed world assumption (Q1825049)

The Weak Generalized Closed World Assumption is introduced. This is a way to deal with negation in logic programs. With this rule the negation \(\neg A\) of a positive literal A is inferred only if \(A\vee K\) is not derivable for any positive K. In contrast with the Generalized Closed World Assumption it is not necessary that K is derivable. The Weak Generalized Closed World Assumption corresponds to the negation as finite failure rule.