SLT-Resolution for the Well-Founded Semantics

02/27/2000
by   Yi-Dong Shen, et al.
0

Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is linear for query evaluation but suffers from infinite loops and redundant computations. In contrast, SLG-resolution resolves infinite loops and redundant computations by means of tabling, but it is not linear. The principal disadvantage of a non-linear approach is that it cannot be implemented using a simple, efficient stack-based memory structure nor can it be easily extended to handle some strictly sequential operators such as cuts in Prolog. In this paper, we present a linear tabling method, called SLT-resolution, for top-down evaluation of the well-founded semantics. SLT-resolution is a substantial extension of SLDNF-resolution with tabling. Its main features include: (1) It resolves infinite loops and redundant computations while preserving the linearity. (2) It is terminating, and sound and complete w.r.t. the well-founded semantics for programs with the bounded-term-size property with non-floundering queries. Its time complexity is comparable with SLG-resolution and polynomial for function-free logic programs. (3) Because of its linearity for query evaluation, SLT-resolution bridges the gap between the well-founded semantics and standard Prolog implementation techniques. It can be implemented by an extension to any existing Prolog abstract machines such as WAM or ATOAM.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2000

Linear Tabulated Resolution Based on Prolog Control Strategy

Infinite loops and redundant computations are long recognized open probl...
research
08/04/2016

Query Answering in Resource-Based Answer Set Semantics

In recent work we defined resource-based answer set semantics, which is ...
research
07/30/2022

Typed SLD-Resolution: Dynamic Typing for Logic Programming

The semantic foundations for logic programming are usually separated int...
research
02/22/2022

Revisiting Semiring Provenance for Datalog

Data provenance consists in bookkeeping meta information during query ev...
research
05/15/2014

Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs

My research goal is to employ a parser generation algorithm based on the...
research
12/13/2015

Using Linear Constraints for Logic Program Termination Analysis

It is widely acknowledged that function symbols are an important feature...
research
04/12/2021

A meta-theory for big-step semantics

It is well-known that big-step semantics is not able to distinguish stuc...

Please sign up or login with your details

Forgot password? Click here to reset