【24h】

Knowledge-Base Rewriting for Bottom-Up Abduction and Integrity Checking

机译:自下而上绑架和完整性检查的知识库重写

获取原文
获取原文并翻译 | 示例

摘要

The objective of this paper is to present a uniform implementation of abduction and integrity checking. We present two rewriting approaches that support abduction and consistency checking by only one inference system, in our case a bottom-up reasoning system.rnThe ABD-transformation extends the Generalized Magic-Sets rewriting to perform bottom-up abduction in deductive databases and logic programs. The transformation proceeds in two steps: In the first step a Generalized Magic-Sets rewriting of a set of rules is performed wrt a given query. With the resulting rule base and a set of abducibles the second transformation step is done getting an abduction rule base. This rule base is evaluated by bottom-up reasoning to compute all abductive explanations for the query.rnThe CF-transformation can be applied to check abductive explanations for consistency. It ensures that bottom-up evaluation derives only the consequences of a set of initial facts. In combination with abduction the initial facts are exactly the literals of an abductive explanation. Evaluation stops, if an inconsistency is derived.
机译:本文的目的是提出绑架和完整性检查的统一实施。我们提供了两种重写方法,它们仅支持一个推理系统(在我们的情况下是自下而上的推理系统)来支持绑架和一致性检查.rn ABD转换扩展了通用魔术集重写以在演绎数据库和逻辑程序中执行自下而上的绑架。 。转换分为两个步骤:在第一步中,使用给定查询对一组规则进行通用魔术集重写。使用生成的规则库和一组可绑带对象,完成第二个转换步骤,以获取绑架规则库。该规则库通过自下而上的推理进行评估,以计算查询的所有归纳解释。rnCF转换可用于检查归纳解释的一致性。它确保自下而上的评估仅得出一组初始事实的结果。与绑架相结合,最初的事实正是绑架解释的字面意思。如果产生不一致,则评估停止。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号