New Zealand

SARL is a general-purpose agent-oriented programming language. This language aims at providing the fundamental abstractions for dealing with concurrency, distribution, interaction, decentralisation, reactivity, autonomy and dynamic reconfiguration that are usually considered essential for implementing agent-based applications. Every programming language specifies an execution model. In the case of SARL, this execution model is defined based on the object-oriented paradigm, i.e., the run-time environment is written in Java. Accordingly, and by default, the SARL programs are transformed into their equivalent object-oriented programs written in Java. The goal of this talk is twofold. Firstly, to explain the mapping between the agent-oriented paradigm and the object-oriented paradigm. Secondly, to define transformations from the SARL constructs to the Java constructs. We advocate that these goals enable the SARL developers to understand the SARL statements, and the mapping to the equivalent executable entities.

AAMAS 2020

Model Transformations from the SARL Agent-Oriented Programming Language to an Object-Oriented Programming Language

technical paper

AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). The aim of the joint conference is to provide a single, high-profile, internationally-respected archival forum for scientific research in the theory and practice of autonomous agents and multi-agent systems.

Browse keynotes, discussions, panels and over 300 presentations.


AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). 

iLQGames.jl: Rapidly Designing and Solving Differential Games in Julia

Learning Cooperative Solution Concepts from Voting Behavior

ORTHOS: A Trustworthy AI Framework for Data Acquisition

Modern interactive software, such as computer games, employ complex user interfaces. Although these user interfaces make the games attractive and powerful, unfortunately they also make them extremely difficult to test. Not only do we have to deal with their functional complexity, but also the fine grained interactivity of their user interface blows up their interaction space. A space so complex, that traditional automated testing techniques have trouble handling it. An agent-based testing approach offers an alternative solution. The agents' goal driven planning, adaptivity, and reasoning ability can provide an extra edge towards effective navigation in complex interaction space. This paper presents aplib, a Java library for programming intelligent test agents, featuring novel tactical programming as an abstract way to exert control over agents' underlying reasoning-based behavior. This type of control is suitable for programming testing tasks. Aplib is implemented in such a way to provide the fluency of a Domain Specific Language (DSL). Its embedded DSL approach also means that aplib programmers will get all the advantages that Java programmers get: rich language features and a whole array of development tools.

Aplib: Tactical Agents for Testing Computer Games

I briefly motivate the project presented by the paper. The contributions of the paper are outlined. I argue for the use of Blocks World for Teams environment. I briefly describe a transformation of GOAL code to agent logic, and how this leads into proving correctness of agents. Finally, I sketch future steps for the project by identifying key challenges.

A Verification Framework for GOAL Agents

An update on the First Intention Progression Competition.

Intention Progression Competition Update

Complex machine learning models are regularly used in critical decision-making domains, as black-box algorithms. This has given rise to several calls for algorithmic explainability. Many explanation algorithms proposed in literature assign importance to each feature individually. However, such explanations fail to capture the joint effects of sets of features. Indeed, few works so far formally analyze high dimensional model explanations. In this paper, we propose a novel high dimension model explanation method that captures the joint effect of feature subsets. We propose a new axiomatization for a generalization of the Banzhaf Index; our method can also be thought of as an approximation of a black-box model by a higher-order polynomial. In other words, this work justifies the use of the generalized Banzhaf index as a model explanation by showing that it uniquely satisfies a set of natural desiderata and that it is the optimal local approximation of a black-box model.

High Dimensional Model Explanations: an Axiomatic Approach

Centrality measures are among the most fundamental tools for social network analysis. Since network data is often incomplete, erroneous, or otherwise manipulated, increasing attention has recently been paid to studying the sensitivity of centrality measures to such distortions. However, thus far no universal method of quantifying the manipulability of centrality measures has been proposed. To bridge this gap in the literature, we take an axiomatic approach. In particular, we introduce a set of intuitive axioms that characterize such a measure, and prove that there exists only one solution that satisfies them. Next, building upon this measure, we quantify the manipulability of the most fundamental centrality measures.

The Manipulability of Centrality Measures—An Axiomatic Approach

The circadian rhythm is responsible for the daily variations in metabolism, and circadian rhythm disorders have direct implications for many diseases, such as obesity and mental disorders. The regulation of sleep time is the most common example of the importance of the circadian rhythm for the functioning of the human body. In this sense, this work aims to study a mathematical and computational model based on multiagent simulation that simulates the synchronization and desynchronization of the circadian rhythm in relation to the pain variables. The results from the multiagent simulation of circadian rhythms show that in relation to pain, sleep, especially its biological rhythms, is directly affected by pain. In this way, our mathematical model was able to show that pain causes changes in the circadian rhythm and it can contribute to the medical field analysis.

Circadian Rhythm and Pain: Mathematical Model based on Multiagent Simulation

Reactive behaviour in BDI-based models and architectures adopted in Agent Programming is typically modelled in terms of reactive plans not bound to any specific goal. In this paper we present and discuss an extension of the plan model used in BDI in which goal-based plans encapsulate both proactive and reactive behaviour. This brings important benefits both in the practice of agent program- ming and in supporting agent reasoning at runtime. The paper first introduced the model formally and then its evaluation through two concrete implementations, based on two existing agent program- ming platforms i.e. Jason and ASTRA.

Model Transformations from the SARL Agent-Oriented Programming Language to an Object-Oriented Programming Language

Downloads

Next from AAMAS 2020

iLQGames.jl: Rapidly Designing and Solving Differential Games in Julia

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES