Generated Models and Extensions or Nonmonotonic Systems

Stable generated models provide a general semantics for logic programming. Although equal for normal programs, they differ from the answer set semantics on disjunctive programs. We show that stable generated semantics coincide with the semantics obtained by translating programs into a minimal partial temporal logic into which a subsystem of default logic can be embedded. This leads us to a new version of disjunctive default logic, based on generated extensions. These results establish a close relation between three different approaches to non-monotonic reasoning: stable generated models of logic programs, default logic, and minimal partial temporal logic.