A Simple Characterization of Extended Abduction
A Simple Characterization of Extended Abduction
复制标题
延伸绑架的简单表征
DOI：
10.1007/3-540-44957-4_48
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
Katsumi Inoue
中科院分区：
文献类型：
--
作者：
Katsumi Inoue
为了解释正向观察和非单调背景理论中的否定观察，井上和Sakama(1995)通过允许移除和添加假设来扩展了传统的溯因。在这篇文章中，我们提出了扩展溯因的一个新的刻画，其中背景理论被写在任何可能包含析取的逻辑程序中。在这种表征中，假设的移除和反解释都可以在传统的溯因逻辑编程的框架内表示。使用这种转换，更新逻辑程序中表示的知识库以及恢复它们的一致性也可以由现有的逻辑程序设计的证明过程来计算。
To explain positive observations and unexplain negative observations from nonmonotonic background theories, Inoue and Sakama (1995) extended traditional abduction by allowing removal as well as addition of hypotheses. In this paper, we propose a new characterization of extended abduction in which a background theory is written in any logic program possibly containing disjunctions. In this characterization, both removal of hypotheses and anti-explanations can be represented within the framework of traditional abductive logic programming. Using this transformation, updating knowledge bases represented in logic programs as well as restoring consistency for them can also be computed by existing proof procedures for logic programming.