loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Katsumi Inoue 1 ; Gauvain Bourgne 1 and Takayuki Okamoto 2

Affiliations: 1 National Institute of Informatics, Japan ; 2 Kobe University, Japan

Keyword(s): Consequence finding, Distributed reasoning, Multi-agent systems.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Distributed and Mobile Software Systems ; Distributed Problem Solving ; Enterprise Information Systems ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Logic Programming ; Multi-Agent Systems ; Software Engineering ; Symbolic Systems

Abstract: When knowledge is physically distributed, information and knowledge of individual agents may not be collected to one agent because they should not be known to others for security and privacy reasons. We thus assume the situation that individual agents cooperate with each other to find useful information from a distributed system to which they belong, without supposing any master or mediate agent who collects all necessary information from the agents. Then we propose two complete algorithms for distributed consequence finding. The first one extends a technique of theorem proving in partition-based knowledge bases. The second one is a more cooperative method than the first one. We compare these two methods on a sample problem showing that both can improve efficiency over a centrlized approach, and then discuss other related approaches in the literature.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.191.13.255

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Inoue, K.; Bourgne, G. and Okamoto, T. (2011). COMPLETE DISTRIBUTED CONSEQUENCE FINDING WITH MESSAGE PASSING. In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-8425-41-6; ISSN 2184-433X, SciTePress, pages 134-143. DOI: 10.5220/0003190001340143

@conference{icaart11,
author={Katsumi Inoue. and Gauvain Bourgne. and Takayuki Okamoto.},
title={COMPLETE DISTRIBUTED CONSEQUENCE FINDING WITH MESSAGE PASSING},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2011},
pages={134-143},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003190001340143},
isbn={978-989-8425-41-6},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - COMPLETE DISTRIBUTED CONSEQUENCE FINDING WITH MESSAGE PASSING
SN - 978-989-8425-41-6
IS - 2184-433X
AU - Inoue, K.
AU - Bourgne, G.
AU - Okamoto, T.
PY - 2011
SP - 134
EP - 143
DO - 10.5220/0003190001340143
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic