Recycling Computed Answers in Rewrite Systems for Abduction

Details Recycling Computed Answers in Rewrite Systems for Abduction Recycling Computed Answers in Rewrite Systems for Abduction

2004-02-16

arxiv.org/abs/cs/0402033v1

Computer Science

Artificial Intelligence

20 pages. Full version of our IJCAI-03 paper

Scientific paper

In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanations for a series of observations with the same domain. The question whether previously computed answers can be recycled arises. A yes answer could result in substantial savings of repeated computations. For systems based on classic logic, the answer is YES. For nonmonotonic systems however, one tends to believe that the answer should be NO, since recycling is a form of adding information. In this paper, we show that computed answers can always be recycled, in a nontrivial way, for the class of rewrite procedures that we proposed earlier for logic programs with negation. We present some experimental results on an encoding of the logistics domain.

Affiliated with

Also associated with

No associations

Rating

Recycling Computed Answers in Rewrite Systems for Abduction 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 Recycling Computed Answers in Rewrite Systems for Abduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recycling Computed Answers in Rewrite Systems for Abduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680427