Symbolic Verification of a Strengh Based Multi-Agent Agumentation Scheme

Shetty, Shravan and Kiran, Shashi H S and Namala, Murali Babu and Singh, Sanjay (2011) Symbolic Verification of a Strengh Based Multi-Agent Agumentation Scheme. International Journal of Artificial Intelligence & Applications, 2 (2). pp. 129-139. ISSN 0975-900X

[img] PDF
IJAIAv2n2.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL:


Software systems have evolved to the age of Artificial Intelligence (AI), consist- ing of independent autonomous agents interacting with each other in dynamic and unpredictable environments. In this kind of environment it is often very difficult to predict all the interactions between the agents. Hence verification of an interaction between multiple agents has become a key research area in AI. In this paper we model and verify an Automatic Meeting Scheduling (AMS) problem having multiple agent communication. The AMS problem helps us to emulate a real life scenario where multiple agents can argue over the defined constraints. A weighted strength based argu- mentation scheme is proposed, where each argument is weighed against each other to determine the strongest evidence. The argumentation model described in the paper have six agents: Initiator, Scheduler and four Participant agents. We have formalized the agent interactions using Computation Tree Logic (CTL) and verified the scheme by providing suitable specifications (SPEC) in a symbolic model verifier tool called, NuSMV.

Item Type: Article
Subjects: Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 22 Jul 2011 11:11
Last Modified: 22 Jul 2011 11:11

Actions (login required)

View Item View Item