Abstract Common-Sense Axiomatizations for Logic Programs

Various semantics for logic programs with negation are described in terms of a dualized program together with additional axioms, some of which are second order formulas. The semantics of Clark, Fitting, and Kunen are characterized in this framework, and a nite rst-order presentation of Kunen's semantics is described. A new axiom to represent \common sense " reasoning is proposed for logic programs. It is shown that the well-founded semantics and stable models are de nable with this axiom. The roles of domain augmentation and domain closure are examined. A \domain foundation " axiom is proposed to replace the domain closure axiom.