Sciweavers

Share
IJCAI
2003

Recycling Computed Answers in Rewrite Systems for Abduction

11 years 1 months ago
Recycling Computed Answers in Rewrite Systems for Abduction
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 proposed earlier in [Lin and You, 2001] for logic programs with negation. We present some experimental results on an encoding of a logistics domain.
Fangzhen Lin, Jia-Huai You
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where IJCAI
Authors Fangzhen Lin, Jia-Huai You
Comments (0)
books