A Procedural Semantics for Well Founded Negation in Logic Programs,

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1988
Accession Number
ADA325956

Entities

People

  • Kenneth A. Ross

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Artificial Intelligence
  • Artificial Intelligence Computing
  • California
  • Computations
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Construction
  • Databases
  • Language
  • New York
  • Parallel Computing
  • Programming Languages
  • Reasoning
  • Semantics
  • Sequences

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.