BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-88-1233
       ENTRY:: April 24, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A Procedural Semantics for Well Founded Negation in Logic
               Programs
        TYPE:: Technical Report
      AUTHOR:: Ross, Kenneth A.
        DATE:: November 1988
       PAGES:: 32
    ABSTRACT:: We introduce global SLS-resolution, a procedural semantics
               for well-founded negation as defined by Van Gelder, Ross and
               Schlipf. Global SLS-resolution extends Przymusinski's
               SLS-resolution, and may be applied to all programs, whether
               locally stratified or not. Global SLS-resolution is defined
               in terms of global trees, a new data structure representing
               the dependence of goals on derived negative subgoals. We
               prove that global SLS-resolutlon is sound with respect to the
               well-founded semantics, and complete for non-floundering
               queries.
       NOTES:: [Adminitrivia V1/Prg/19950424]
         END:: STAN//CS-TR-88-1233