课题基金 / 基金详情

Semantics and Proof Procedure for Abductive Logic Programming

Semantics and Proof Procedure for Abductive Logic Programming
归纳逻辑编程的语义和证明过程
批准号:
06452404
负责人:
YAMASAKI Susumu
金额:
$2.05万
依托单位:
依托单位国家:
日本
项目类别:
Grant-in-Aid for Scientific Research (B)
财政年份:
1994
资助国家:
日本
项目状态:
已结题
起止时间:
1994 至 1996

项目摘要

项目成果

YAMASAKI Susumu的其他基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
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
期刊论文(27)
专著(0)
科研奖励(0)
会议论文
西井,山崎: "一般論理プログラムに対する安全でないSLDNF導出と最小不動点意味論" 人工知能学会誌. 10. 予定 (1995)
Nishii, Yamazaki:“通用逻辑程序的不安全 SLDNF 推导和最小定点语义”日本人工智能学会杂志 10。计划 (1995)。
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
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 信息和系统。
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
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。
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
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(计划)。
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
27
    Integration of Logic and Functional Languages Based on Dataflow
    • 批准号:
      02680028
    • 项目类别:
      Grant-in-Aid for General Scientific Research (C)
    • 资助金额:
      $1.02万
    • 财政年份:
      1990
    • 负责人:
      YAMASAKI Susumu
    • 依托单位: