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

Construction of Logical Multi-Agent System under Incomplete Information Environment

Research Project

Project/Area Number 11480070
Research Category

Grant-in-Aid for Scientific Research (B).

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionHOKKAIDO UNIVERSITY

Principal Investigator

SATOH Ken  Hokkaido University., Grad.School of Eng., Asso.Prof., 大学院・工学研究科, 助教授 (00271635)

Co-Investigator(Kenkyū-buntansha) IWANUMA Koji  Yamanashi University, Fac.of Eng., Asso.Prof., 工学部, 助教授 (30176557)
SAKAMA Chiaki  Wakayama University, Fac.of Sys. Eng., Asso.Prof., システム工学部, 助教授 (20273873)
INOUE Katsumi  Kobe University, Fac.of Eng., Asso.Prof., 工学部, 助教授 (10252321)
Project Period (FY) 1999 – 2000
Project Status Completed (Fiscal Year 2000)
Budget Amount *help
¥11,100,000 (Direct Cost: ¥11,100,000)
Fiscal Year 2000: ¥3,900,000 (Direct Cost: ¥3,900,000)
Fiscal Year 1999: ¥7,200,000 (Direct Cost: ¥7,200,000)
Keywordsmulti agent system / incomplete information / speculative computation / abduction / abductive logic programming / default reasoning / 仮説論理型プログラミンク / 仮設論理型プログラミング / 仮設推論
Research Abstract

We presented speculative computation by abduction in multi-agent systems and showed that this method can be used for distributed problem solving under incomplete communication environments.
The idea of the method is as follows :
- When communication is delayed or failed, then we use a default hypothesis as a tentative answer and continue computation.
- When some response is obtained, we check consistency of the response and the current computation. If the response is consistent, then we continue the current computation ; else if the response is inconsistent, we seek an alternative computation.
We proposed a proof procedure of speculative computation in a master-slave multi-agent systems and showed that it returns correct answers for the perfect model semantics in a stratified logic program. Based on the proof procedure, we made a simiulator on parallel machines to show effectiveness of this method.

Report

(3 results)
  • 2000 Annual Research Report   Final Research Report Summary
  • 1999 Annual Research Report
  • Research Products

    (24 results)

All Other

All Publications (24 results)

  • [Publications] 若木利子: "拡張論理プログラミングへの意味論的関係に基づく変換による優先順位付き極小限定の計算"人工知能学会誌. 14・3. 466-472 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Iwayama,N.: "Computing Abduction by Using TMS with Top-Down Expectation"Journal of Logic Programming. 印刷中. (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Iwanuma,K.: "Lemma Generalization and Non-Unit Lemma Matching for Model Elimination"Lecture Note in Artifical Intelligence. 1742. 163-176 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Inoue,K.: "Computing Extended Abduction through Transaction Programs"Annals of Mathematics and Artificial Intelligence. 25(3,4). 339-367 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Sakama,C.: "Updating Extended Logic programs through Abduction"Lecture Notes in Artificial Intelligence. 1730. 147-161 (1999)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Satoh,K.: "Speculative Computation by Abduction under Incomplete Communication Environments"Proc.of ICMAS2000. 263-270 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Inoue,K.: "A Simple Characterization of Extended Abduction"Proc.of CL2000, Lecture Notes in Artificial Intelligence. 1861. 718-732 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Iwanuma,K.: "Completeness of Pruning Methods for Consequence Finding Procedure SOL"Proc.of FTP'2000. 89-100 (2000)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Wakaki, T., Satoh, K.: "Computing Prioritized Circumscription by Compiling into Extended Logic Programs based on the Semantic Relationship"Journal of Japanese Society of Artificial Intelligence. Vol.14, No.3. 466-472 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Iwayama, N., Satoh, K.: "Computing Abduction by Using TMS with Top-Down Expectation"Journal of Logic Programming. Vol.44 No.1-3. 179-206 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Iwanuma, K., Kishino, K.: "Lemma Generalization and Non-Unit Lemma Matching for Model Elimination"Lecture Note in Artificial Inntelligence. Vol.1742. 163-176 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Inoue, K., Sakama, C.: "Computing Extened Abduction through Transaction Programs"Annals of Mathematics and Artificial Intelligence. Vol.25(3-4). 339-367 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Sakama, C., Inoue K.: "Updating Extended Logic Programs through Abduction"Lecture Note in Artificial Inntelligence. Vol.1730. 147-161 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Satoh, K., Inoue, K., Iwanuma, K., Sakama, C.: "Speculative Computation by Abduction under Incomplete Communication Environments"Proc. of ICMAS2000. 263-270 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Inoue, K.: "A Simple Characterization of Extended Abduction""Proc. of CL2000, Lecture Notes in Artificial Intelligence. Vol.1861. 718-732 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Iwanuma, K., Inoue, K., Satoh, K.: "Completeness of Pruning Methods for Consequence Finding Procedure SOL"Proc. of FTP'2000. 89-100 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2000 Final Research Report Summary
  • [Publications] Satoh, K.: "Speculative Computation by Abduction under Incomplete Communication Environments"Proc.of ICMAS2000. 263-270 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Inoue, K.: "A Simple Characterization of Extended Abduction"Proc.of CL2000, LNAI. 1861. 718-732 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Iwanuma, K.: "Completeness of Pruning Methods for Consequence Finding Procedure SOL"Proc.of FTP'2000. 89-100 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 若木 利子,佐藤 健: "拡張論理プログラミングへの意味論的関係に基づく変換による優先順位付き極小限定の計算"人工知能学会誌. 14・3. 466-472 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] N. Iwayama and K. Satoh: "Computing Abduction by Using TMS with Top-Down Expectation"Journal of Logic Programming. (印刷中). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] K. Iwanuma and K. Kishino: "Lemma Generalization and Non-Unit Lemma Matching for Model Elimination"Lecture Note in Computer Science. Vol.1742. 163-176 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] K. Inoue and C. Sakama: "Computing Extended Abduction through Transaction Programs"Annals of Mathematics and Artificial Intelligence. 25(3,4). 339-367 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] C. Sakama and K. Inoue: "Updating Extended Logic programs through Abduction"Lecture Notes in Artificial Intelligence. Vol.1730. 147-161 (1999)

    • Related Report
      1999 Annual Research Report

URL: 

Published: 1999-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi