• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1996 Fiscal Year Final Research Report Summary

Semantics and Proof Procedure for Abductive Logic Programming

Research Project

Project/Area Number 06452404
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionOkayama University

Principal Investigator

YAMASAKI Susumu  Okayama University, Info.Tech.Dept., Professor, 工学部, 教授 (10026354)

Project Period (FY) 1994 – 1996
KeywordsLogic program / Two-valued stable model / Three-valued stable model / negation as failure / SLDNF resolution / abductive proof procedure / abduction framework / semantics
Research Abstract

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

  • Research Products

    (17 results)

All Other

All Publications (17 results)

  • [Publications] S.Yamasaki and K.Iida: "Transformation of logic programs to FP programs based on data flows" J.of Symbolic Computation. 18,2. 157-182 (1994)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 西井・山崎: "一般論理プログラムに対する安全でないSLDNF導出と最小不動点意味論" 人工知能学会誌. 10,2. 262-270 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 定立・山崎: "矛盾による否定と二重否定問題" 人工知能学会誌. 10,6. 953-961 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Yamasaki: "SLDNF nesolution with non-safe rule and fixpoint semautics for general logic programs" Theoretical Computer Scienee. 160. 283-303 (1996)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Yamasaki: "An abstraction of fixpoint semautics for normal logic programs" IEICE Trans.on Information and Systems. E79-D,3. 196-208 (1996)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Yamasaki: "Seguence domains and fixpoint semautics for logic psograms" IEICE Trans.on Information and Systems. E79-D,6. 840-854 (1996)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Yamasaki and N.Ishil: "General stable model semantics and SLDNF resolution with non-safe rule for abduction" J.of Japanese Society for Artificial Iutelligence. 12,2. 245-257

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 川田・山崎: "状況理論に基づくプランニング争点解消手法" 人工知能学会誌. 12,3(予定). (1997)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Yamasaki et al.: "Transformation of logic programs to FP programs based on dataflows" J.of Symbolic Computation. 18,26. (1994)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y.Nishii et al.: "Non-sale SLDNF resolution and least fixpoint semantics of general logic programs" J.of Japanese Society for AI. 10,9. (1995)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] W.Adachi et al.: "Negation as inconsistency and double negation law problem" J.of Japanese Society for AI.10,6. 9 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S.Yamasaki: "Control problem of a class of pushdown automata based on posets and its application to resolution deductions" IEICE Trans.on Infor.Syst.E78-D. 10 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S.Yamasaki: "SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs" Theoretical Computer Science. 160. 21 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S.Yamasaki: "An abstraction of fixpoint semantics for normal logic programs" IEICE Trans.on Infor.Syst.E79-D. 13 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S.Yamasaki: "Sequence domains and fixpoint semantics for logic programs" IEICE Trans.on Infor.Syst.E79-D. 15 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S.Yamasaki et al.: "General stable model semantics and SLDNF resolution with non-safe rule for abduction." J.of Japanese Society for AI. 12. 13 (1997)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] A.Kawada et al.: "Dissolution of points in dispute based on situation theory planning" J.of Japanese Society for AI. 12. 10 (1997)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1999-03-09  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi