Stefano Bistarelli
Paola Campli
ABSTRACT
Forming coalition structures allows agents to join their forces with the aim to achieve a common task. We suggest it would be interesting to look for homogeneous groups which follow distinct lines of thought. For this reason, we extend the Dung Argumentation Framework in order to deal with coalitions of arguments. The initial set of arguments is partitioned into subsets (or coalitions). Each coalition represents a different line of thought, but all the found coalitions show the same property inherited by Dung, e.g. all the coalitions in the partition are admissible (or conflict-free, complete, stable). Some problems in weighted argumentation are NP complete; we use (soft) constraints as a formal approach to reason about coalitions and to model all these problems in the same framework. Semiring algebraic structures can be used to model different optimization criteria for the obtained coalitions. To implement this mapping and practically find its solutions we use JaCoP, a Java constraint solver, and we test the code over a small-world network.
- L. Amgoud. An argumentation-based model for reasoning about coalition structures. In ArgMAS05, volume 4049 of LNCS, pages 217--228. Springer, 2005. Google Scholar
Digital Library
- K. R. Apt and A. Witzel. A generic approach to coalition formation. CoRR, abs/0709.0435, 2007.Google Scholar
- S. Bistarelli. Semirings for Soft Constraint Solving and Programming, volume 2962 of LNCS. Springer, 2004. Google ScholarDigital Library
- S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2): 201--236, March 1997. Google ScholarDigital Library
- S. Bistarelli and F. Santini. A common computational framework for semiring-based argumentation systems. In ECAI'10, volume 215, pages 131--136. IOS Press, 2010. Google ScholarDigital Library
- G. Boella, L. van der Torre, and S. Villata. Social viewpoints for arguing about coalitions. In PRIMA, volume 5357 of LNCS, pages 66--77. Springer, 2008. Google ScholarDigital Library
- K. P. Bogart. Introductory Combinatorics. Academic Press, Inc., Orlando, FL, USA, 2000. Google ScholarDigital Library
- N. Bulling, J. Dix, and C. I. Chesñevar. Modelling coalitions: Atl + argumentation. pages 681--688. IFAAMAS, 2008. Google ScholarDigital Library
- P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell., 77(2): 321--357, 1995. Google ScholarDigital Library
- P. E. Dunne, A. Hunter, P. McBurney, S. Parsons, and M. Wooldridge. Inconsistency tolerance in weighted argument systems. pages 851--858. IFAAMS, 2009. Google ScholarDigital Library
- W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In IJCAI (1), pages 607--615, 1995. Google ScholarDigital Library
- B. Horling and V. Lesser. A survey of multi-agent organizational paradigms. Knowl. Eng. Rev., 19(4): 281--316, 2004. Google ScholarDigital Library
- G. Katsirelos and T. Walsh. Dynamic symmetry breaking constraints. In Workshop on Modeling and Solving Problems with Constraints (at ECAI08), pages 39--44. Informal Proc., 2008.Google Scholar
- J. Kleinberg. Navigation in a small world. Nature, 406: 845, 2000.Google Scholar
- K. Kuchcinski and R. Szymanek. Jacop - java constraint programming solver, 2001. http://jacop.osolpro.com/.Google Scholar
- N. Ohta, V. Conitzer, R. Ichimura, Y. Sakurai, A. Iwasaki, and M. Yokoo. Coalition structure generation utilizing compact characteristic function representations. In CP, volume 5732 of LNCS, pages 623--638. Springer, 2009. Google ScholarDigital Library
- J. O'Madadhain, D. Fisher, S. White, and Y. Boey. The JUNG (Java Universal Network/Graph) framework. Technical report, UC Irvine, 2003.Google Scholar
- F. Rossi, P. van Beek, and T. Walsh. Handbook of Constraint Programming. Elsevier Science Inc., NY, USA, 2006. Google ScholarDigital Library
- O. Shehory and S. Kraus. Task allocation via coalition formation among autonomous agents. In IJCAI (1), pages 655--661, 1995. Google ScholarDigital Library
Index Terms
- Finding partitions of arguments with Dung's properties via SCSPs
Recommendations
On the merging of Dung's argumentation systems
In this paper, the problem of deriving sensible information from a collection of argumentation systems coming from different agents is addressed. The underlying argumentation theory is Dung's one: each argumentation system gives both a set of arguments ...
Real arguments are approximate arguments
AAAI'07: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an ...
A Plan Based Coalition Formation Model for Multi-agent Systems
WI-IAT '11: Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02This article addresses the coalition formation problem in a multi-agent context where agents plan their activities dynamically and use these plans to coordinate their actions and form suitable coalitions. In most coalition formation methods, when ...
Comments