Presentation 2005/3/7
Distributed consequence finding with message communication
Takayuki OKAMOTO, Katsumi INOUE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) When knowledge is geographically distributed, individual information might not be able to be collected to one agent because it does not want to be known to others. We aim that individual agents cooperate each other to solve the problem without collecting information to one agent in such a situation. This paper proposes two complete algorithms to the consequence finding. The first one extends the technique of theorem proving from distributed knowledge bases by Amir and McIlraith. The second one is a more cooperative method than the first one. We compare these two methods with experiments.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) message passing / communication language / consequence finding
Paper # AI2004-75
Date of Issue

Conference Information
Committee AI
Conference Date 2005/3/7(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Distributed consequence finding with message communication
Sub Title (in English)
Keyword(1) message passing
Keyword(2) communication language
Keyword(3) consequence finding
1st Author's Name Takayuki OKAMOTO
1st Author's Affiliation Graduate School of Science Techology, Kobe University:National Institute of Informatics Department()
2nd Author's Name Katsumi INOUE
2nd Author's Affiliation National Institute of Informatics Department
Date 2005/3/7
Paper # AI2004-75
Volume (vol) vol.104
Number (no) 726
Page pp.pp.-
#Pages 6
Date of Issue