Accession Number : ADA325956
Title : A Procedural Semantics for Well Founded Negation in Logic Programs,
Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Ross, Kenneth A.
PDF Url : ADA325956
Report Date : DEC 1988
Pagination or Media Count : 30
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-resolution is sound with respect to the well-founded semantics, and complete for non-floundering queries.
Descriptors : *PROGRAMMING LANGUAGES, *SEMANTICS, DATA BASES, DATA MANAGEMENT, COMPUTER LOGIC, COMPUTER PROGRAM VERIFICATION, STRUCTURED PROGRAMMING.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE