Stable generated models for extended generalized logic programs with two ki
nds of negation provide a semantics for logic programming in its (up to now
) most general form. We show that stable generated semantics for extended l
ogic programs coincides with the semantics obtained by translating programs
into a minimal partial temporal logic. Then we introduce several new versi
ons of (disjunctive) default logic and show that there are strong (semantic
al) connections between default logic and logic programming with stable gen
erated models. (C) 1999 Elsevier Science Inc. All rights reserved.