Construction of Logical Multi-Agent System under Incomplete Information Environment

不完全信息环境下逻辑多Agent系统的构建

• 批准号: 11480070
• 负责人: SATOH Ken
• 金额: $ 7.1万
• 依托单位: HOKKAIDO UNIVERSITY
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (B).
• 财政年份: 1999
• 资助国家: 日本
• 起止时间: 1999 至 2000
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-11480070/
• 关键词: multi agent system; incomplete information; speculative computation; abduction; abductive logic programming; default reasoning; 仮説論理型プログラミンク; 仮設論理型プログラミング; 仮設推論

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.

我们通过绑架了多代理系统提出了投机性计算，并表明该方法可用于在不完整的通信环境下解决分布式问题解决。该方法的概念如下： - 当通信延迟或失败时，我们将默认假设用作临时答案并继续计算。如果响应是一致的，那么我们将继续当前的计算。否则，如果响应不一致，我们会寻求替代计算。我们在主奴隶多代理系统中提出了一个投机计算的证明程序，并表明它在分层逻辑程序中为完美的模型语义返回了正确的答案。根据证明程序，我们在平行机上进行了一个模拟器，以显示该方法的有效性。

项目成果

Sakama, C., Inoue K.: "Updating Extended Logic Programs through Abduction"Lecture Note in Artificial Inntelligence. Vol.1730. 147-161 (1999)

Sakama, C., Inoue K.：“通过推理更新扩展逻辑程序”人工智能讲义。

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)

Wakaki, T.，Satoh, K.：“通过基于语义关系编译成扩展逻辑程序来计算优先限制”日本人工智能学会杂志。

Iwanuma, K., Inoue, K., Satoh, K.: "Completeness of Pruning Methods for Consequence Finding Procedure SOL"Proc. of FTP'2000. 89-100 (2000)

Iwanuma, K.、Inoue, K.、Satoh, K.：“后果查找程序 SOL 修剪方法的完整性”Proc。

Inoue,K.: "Computing Extended Abduction through Transaction Programs"Annals of Mathematics and Artificial Intelligence. 25(3,4). 339-367 (1999)

Inoue,K.：“通过事务程序计算扩展溯因”数学和人工智能年鉴。

Iwanuma, K., Kishino, K.: "Lemma Generalization and Non-Unit Lemma Matching for Model Elimination"Lecture Note in Artificial Inntelligence. Vol.1742. 163-176 (1999)

Iwanuma, K.、Kishino, K.：“用于模型消除的引理泛化和非单位引理匹配”人工智能讲义。