Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms

Details Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms

2005-07-14

arxiv.org/abs/cs/0507035v1

Theoretical Computer Science 328(3):271-287, 2004

Computer Science

Logic in Computer Science

Scientific paper

Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. It inherits from SLDNF-resolution the {\em linearity} property of derivations, which makes it easy and efficient to implement using a simple stack-based memory structure. However, like SLDNF-resolution it suffers from the problem of infinite loops and redundant computations. To resolve this problem, in this paper we develop a new procedural semantics, called {\em SLTNF-resolution}, by enhancing Global SLS-resolution with loop cutting and tabling mechanisms. SLTNF-resolution is sound and complete w.r.t. the well-founded semantics for logic programs with the bounded-term-size property, and is superior to existing linear tabling procedural semantics such as SLT-resolution.

Affiliated with

Also associated with

No associations

Rating

Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575010