Report Number: CS-TR-88-1233
Institution: Stanford University, Department of Computer Science
Title: A Procedural Semantics for Well Founded Negation in Logic Programs
Author: Ross, Kenneth A.
Date: November 1988
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.