Efficient Instance Retrieval of Subgoals for Subsumptive Tabled Evaluation of Logic Programs

Details Efficient Instance Retrieval of Subgoals for Subsumptive Tabled Evaluation of Logic Programs Efficient Instance Retrieval of Subgoals for Subsumptive Tabled Evaluation of Logic Programs

2011-07-27

arxiv.org/abs/1107.5556v1

Theory and Practice of Logic Programming, Volume 11, Special Issue 4-5, July 2011, pp 697-712 Published Cambridge University P

Computer Science

Programming Languages

Theory and Practice of Logic Programming, 27th Int'l. Conference on Logic Programming (ICLP 2011) Special Issue, volume 11, is

Scientific paper

10.1017/S1471068411000251

Tabled evaluation is an implementation technique that solves some problems of traditional Prolog systems in dealing with recursion and redundant computations. Most tabling engines determine if a tabled subgoal will produce or consume answers by using variant checks. A more refined method, named call subsumption, considers that a subgoal A will consume from a subgoal B if A is subsumed by (an instance of) B, thus allowing greater answer reuse. We recently developed an extension, called Retroactive Call Subsumption, that improves upon call subsumption by supporting bidirectional sharing of answers between subsumed/subsuming subgoals. In this paper, we present both an algorithm and an extension to the table space data structures to efficiently implement instance retrieval of subgoals for subsumptive tabled evaluation of logic programs. Experiments results using the YapTab tabling system show that our implementation performs quite well on some complex benchmarks and is robust enough to handle a large number of subgoals without performance degradation.

Affiliated with

Also associated with

No associations

Rating

Efficient Instance Retrieval of Subgoals for Subsumptive Tabled Evaluation of Logic Programs 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 Efficient Instance Retrieval of Subgoals for Subsumptive Tabled Evaluation of Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Instance Retrieval of Subgoals for Subsumptive Tabled Evaluation of Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-113941