ACM Home Page
Please provide us with feedback. Feedback
Efficient argumentation over ontology correspondences
Full text PdfPdf (207 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents
Budapest, Hungary
SESSION: Interactions table of contents
Pages 1241-1242  
Year of Publication: 2009
ISBN:978-0-9817381-7-8
Authors
Paul Doran  University of Liverpool, UK
Valentina Tamma  University of Liverpool, UK
Ignazio Palmisano  University of Liverpool, UK
Terry R. Payne  University of Liverpool, UK
Sponsors
: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd
Publisher
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

The ability to communicate is one of the key capabilities of an agent within a Multi-Agent System. In open environments, where agents are likely to use heterogeneous ontologies, it is necessary to use formally defined ontologies [1] to support communication. However, this requires either a shared ontology, or a set of correspondences (alignment) that map semantically related entities from one ontology to another. The open nature of such environments results in this being unlikely due to few a priori assumptions being made about the agents present; thus requiring techniques for dynamic alignment and reconciliation. To dynamically reconcile heterogeneous ontologies, agents need to be able to agree on an acceptable alignment between their ontologies. Various approaches attempt to resolve ontological mismatches in open environments [8, 4], using negotiation approaches that search the space of alignments to find a mutually acceptable set of correspondences. However, this search can become prohibitively costly when negotiation mechanisms such as argumentation are involved, reaching II(p)2-complete [5]. Hence, it is important to reduce the search space before the argumentation process takes place. The Meaning-based Argumentation approach [8] allows two agents to dynamically and automatically reach consensus by arguing over a set of candidate mappings (or correspondences) obtained from a mapping repository. We have explored the use of Ontology Modularization as a filtering mechanism for reducing the number of candidate mappings, by isolating only those mappings that are relevant to the communication, and hence reducing the size of the search space for the argumentation process.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
T. Berners-Lee, J. Hendler, and O. Lassila. The semantic web. Scientific American, 284(5), 2001.
 
2
B. Cuenca Grau, I. Horrocks, Y. Kazakov, and U. Sattler. Modular reuse of ontologies: Theory and practice. JAIR, 31:273--318, 2008.
3
 
4
 
5
P. E. Dunne and T. J. M. Bench-Capon. Complexity in Value-Based Argument Systems. In J. J. Alferes and J. A. Leite, editors, JELIA, volume 3229 of LNCS, pages 360--371. Springer, 2004.
 
6
 
7
J. Euzenat and P. Valtchev. Similarity-based ontology alignment in OWL-Lite. In ECAI-04, 2004.
8
9

Collaborative Colleagues:
Paul Doran: colleagues
Valentina Tamma: colleagues
Ignazio Palmisano: colleagues
Terry R. Payne: colleagues