重写溯因系统中计算答案的循环利用
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 that we proposed earlier for logic programs with negation. We present some experimental results on an encoding of the logistics domain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。