The paper characterises the nonmonotonic inference relation associated
with the stable model semantics for logic programs as follows: a form
ula is entailed by a program in the stable model semantics if and only
if it belongs to every intuitionistically complete and consistent ext
ension of the program formed by adding only negated atoms. In place of
intuitionistic logic, any proper intermediate logic can be used. (C)
1999 Elsevier Science Inc. All rights reserved.