A Procedural Semantics for Well Founded Negation in Logic Programs

Authors:
Kenneth A. Ross
Affiliations:
-
Venue:
A Procedural Semantics for Well Founded Negation in Logic Programs
Year:
1988

Citing 0
Cited 1

A procedural semantics for well founded negation in logic programs

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

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.