AI*IA 2018 – Advances in Artificial Intelligence

This paper presents a concise description of the major features of the Jadescript language for agent-oriented programming. First, the need for a programming language intended explicitly to support the design and implementation of agents and multi-agent systems based on JADE is motivated. Then, core features which characterise the language as an agent-oriented programming language, namely, those meant to support message passing and event-driven programming, are briefly described. The description of core features uses an illustrative example to show how the language can be concretely used to program multi-agent systems, at least in simple, but significant, cases.

[1]  Francesca Rossi,et al.  Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems , 2017, ADT.

[2]  David Manlove,et al.  Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.

[3]  Thomas Schiex,et al.  Soft Constraints , 2000, Handbook of Constraint Programming.

[4]  Toby Walsh,et al.  Manipulation complexity and gender neutrality in stable marriage procedures , 2009, Autonomous Agents and Multi-Agent Systems.

[5]  Ronen I. Brafman,et al.  Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms , 2010, KR.

[6]  Grigorios Tsoumakas,et al.  Mining Multi-label Data , 2010, Data Mining and Knowledge Discovery Handbook.

[7]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[8]  David Manlove,et al.  Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[9]  Grigorios Tsoumakas,et al.  Random K-labelsets for Multilabel Classification , 2022 .

[10]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[11]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[12]  Andrew Zisserman,et al.  All About VLAD , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[13]  David Manlove,et al.  A Constraint Programming Approach to the Hospitals / Residents Problem , 2007, CPAIOR.

[14]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[15]  Atila Abdulkadiro.  Generalized Matching for School Choice , 2011 .

[16]  Barry O'Sullivan,et al.  From Marriages to Coalitions: A Soft CSP Approach , 2009, CSCLP.

[17]  Jürgen Schmidhuber,et al.  Long Short-Term Memory , 1997, Neural Computation.

[18]  Toby Walsh,et al.  Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences , 2013, Algorithms.

[19]  Toby Walsh,et al.  Compact Preference Representation in Stable Marriage Problems , 2009, ADT.

[20]  Ronen I. Brafman,et al.  CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[21]  Francesca Rossi,et al.  Stable matching problems with soft constraints , 2014, AAMAS.

[22]  Yoshua Bengio,et al.  Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation , 2014, EMNLP.

[23]  Rina Dechter,et al.  Search Algorithms for m Best Solutions for Graphical Models , 2012, AAAI.

[24]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[25]  David Manlove,et al.  A Constraint Programming Approach to the Stable Marriage Problem , 2001, CP.

[26]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..