Semantics and Proof Procedure for Abductive Logic Programming

归纳逻辑编程的语义和证明过程

• 批准号: 06452404
• 负责人: YAMASAKI Susumu
• 金额: $ 2.05万
• 依托单位: Okayama University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (B)
• 财政年份: 1994
• 资助国家: 日本
• 起止时间: 1994 至 1996
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-06452404/
• 关键词: Logic program; Two-valued stable model; Three-valued stable model; negation as failure; SLDNF resolution; abductive proof procedure; abduction framework; semantics; アブダクション手続き; 3値論理; 一般論理プログラム; アブダクション枠組の制約条件; アブダクション; 拡張論理プログラム; 矛盾による否定; 古

Semantics of general logic programs may be defined by both 2-valued stable and 3-valued stable models, while SLDNF resolution (SLD resolution with negation as failure) is adopted as a procedure for the completion of general logic programs. When SLDNF resolution was well-organized as a basis of abductive proof procedure (Eshghi and Kowalski procedure), it was firstly examined whether the procedure is sound with respect to 2-valued stable model. However, it has been proved to be sound with respect to-3-valued stable model (Dung, 1991).This research project is concerned with a generalization of negation as failure to be made use of for an abductive proof procedure, and an abduction framework in 3-valued logtic, a generalization of Eshghi and Kowalski framework.When applying negation as failure, we usually take a safe ruls :*(]SY.reverse left half-bracket.[)A suceeds if * A finitely fails, and*(]SY.reverse left half-bracket.[)A finitely fails if * A succeeds,where A is a ground atom. To ge … More t non-ground abducibles, we rather take Shepherdson's rule (a non-safe rule) :*(]SY.reverse left half-bracket.[)Arheta succeeds if * Arheta finitely fails for some substitution rheta, and*(]SY.reverse left half-bracket.[)A finitely fails if * A succeeds with the empty substitution,for an abductive proof procedure. Soundness of a refined abductive proof procedure is proven with respect to a general 3-valued stable model, which is defined over a domain containing variables.As another aspect, we have an abduction framework in 3-valued logic, where an integrity constraint is organized so that it may induce a generalized abductive proof procedure, which involves an adjustment to deal with any proposition to be neither an abducible nor derived from the theory and the abducibles. The integrity constraint is proved to be in a close relationship with a 3-valued stable model.This reoport comprises these two aspects in three parts :(1) Semantics for logic programs.(2) Refinements of SLDNF resolution.(3) Generalizations of abductive procedures and abduction framework. Less

一般逻辑程序的语义可以由二值稳定模型和三值稳定模型来定义，而SLDNF归结(SLD归结，否定为失败)被用作完成一般逻辑程序的过程。当SLDNF归结被很好地组织为溯因证明过程(Eshghi和Kosalski过程)的基础时，首先检验该过程关于2值稳定模型是否合理。然而，对于-3值稳定模型(Dung，1991)，它已被证明是可靠的。本研究项目涉及到否定的推广，即不能用于溯因证明过程，以及三值逻辑中的一个推导框架，Eshghi和Kosalski框架的推广。当应用否定作为失败时，我们通常采用一个安全规则：*(]SY.反左半括号。[)如果*A有限失败，则A成功，且*(]SY.反左半括号。[)如果*A成功，则有限失败，其中A是地面原子。到GE…对于更多的非地面可诱导性，我们宁愿采用谢泼德森规则(一条不安全的规则)：*(]SY.反向左半括号。[)Arheta如果*Arheta对于某些替换Rheta有限地失败，则Arheta成功，并且*(]SY.反向左半括号。[)如果*A成功地进行空代换，则A有限失败，用于溯因证明过程。另一方面，我们在三值逻辑中有一个溯因框架，其中完整性约束被组织起来，使得它可以诱导一个广义溯因证明过程，它涉及到处理任何命题既不是溯因也不是从理论和溯因中派生的命题的调整。完整性约束与一个三值稳定模型有着密切的关系，它包括三个方面：(1)逻辑程序的语义；(2)SLDNF归结的精化；(3)溯因过程和溯因框架的推广。较少

项目成果

西井,山崎: "一般論理プログラムに対する安全でないSLDNF導出と最小不動点意味論" 人工知能学会誌. 10. 予定 (1995)

Nishii, Yamazaki：“通用逻辑程序的不安全 SLDNF 推导和最小定点语义”日本人工智能学会杂志 10。计划 (1995)。

S.Yamasaki: "Seguence domains and fixpoint semautics for logic psograms" IEICE Trans.on Information and Systems. E79-D,6. 840-854 (1996)

S.Yamasaki：“逻辑图的序列域和固定点语义”IEICE Trans.on 信息和系统。

W.Adachi et al.: "Negation as inconsistency and double negation law problem" J.of Japanese Society for AI.10,6. 9 (1995)

W.Adachi 等人：“否定作为不一致和双重否定法问题”J.of Japanese Society for AI.10,6。

S.Yamasaki and N.Ishiba: "General stable model semantics and SLDNF resolution with non-safe rule for abduction" J.of Japanese Society for Artifical Intelligeme. Vol.12No.3 (予定). (1997)

S.Yamasaki 和 N.Ishiba：“一般稳定模型语义和具有非安全绑架规则的 SLDNF 解决方案”J.of Japanese Society for Artifical Intelligeme Vol.12No.3（计划）。

川田・山崎: "状況理論に基づくプランニング争点解消手法" 人工知能学会誌. 12,3(予定). (1997)

川田和山崎：“基于情境理论的规划争议解决方法”人工智能学会杂志12，3（预定）。