Combining explicit negation and negation by failure via Belnap's logic

This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation. This allows two different forms of reasoning in the presence of incomplete information. Such pro,srams have been introduced by Gelfond and Lifschitz and called extended programs. We provide them with a logical semantics in the style of Kunen, based on Belnap's four-valued logic, and an answer sets' semantics that is shown to be equivalent to that of Gelfond and Lifschitz. The proofs rely on a translation into normal programs, and on a variant of Fitting's extension of logic programming to bilattices.