Computational Logic for Social Abilities in Multiagent Systems
| Project/Area Number |
17500095
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Wakayama University |
|---|
Principal Investigator |
SAKAMA Chiaki Wakayama University, Faculty of Systems Engineering, Professor (20273873)
|
|---|
| Project Period (FY) |
2005 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥3,600,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥300,000)
Fiscal Year 2007: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2006: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 2005: ¥1,200,000 (Direct Cost: ¥1,200,000)
|
|---|
| Keywords | multiagent systems / answer set programming / coordination / consensus / negotiation / program transformation / マルチエージェントシステム / アブダクション / 条件緩和 / 信念の調整 / プログラム合成 |
|---|
| Research Abstract |
In this research, we study computational logic for multiagent systems. We focus on social abilities of agents such as coordination, coalition, consensus, and negotiation. We then formulate those abilities in terms of computational logic. To this end, we first consider an agent who has a knowledge base as a logic program with the answer set semantics. Answer sets represent belief sets which are built by a rational reasoner on the basis of a program. Different agents have different answer sets in general. To coordinate different belief sets of agents, we introduce program transformations which construct new programs having intermediate meanings between different agents. We also develop several program transformations: one realizes coalition by combining different answer sets, and another one realizes consensus by extracting common beliefs from different answer sets. Those program transformations produce serial knowledge bases which reflect results of coordination, coalition, and consensus in an agent community. Moreover, we provide methods for evaluating proposals and constructing new counterproposals in the process of negotiation. Tb build new proposals, we use abduction and induction in artificial intelligence, and relaxation techniques in cooperative query answering for databases. The proposed methods integrate commonsense reasoning and social reasoning of multiple agents in the context of logic programming, and are realized on top of the existing answer set solvers. The results of this study contribute to a step on understanding social behavior of multiple agents by means of computational logic, and also serve as an important application of artificial intelligence and logic programming.
|
Report
(4 results)
Research Products
(19 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Negotiation by Abduction and Relaxation2007
Author(s)
Chiaki, Sakama, Katsumi, Inoue
Organizer
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems1 pages 018-1025
Place of Presentation
Hawaii, USA
Description
「研究成果報告書概要(欧文)」より
Related Report
-
-
-
-
