scholarly journals Architecture Modelling and Formal Analysis of Intelligent Multi-Agent Systems

2019 ◽  
Author(s):  
Ashalatha Kunnappiilly ◽  
Simin Cai ◽  
Raluca Marinescu ◽  
Cristina Seceleanu
Keyword(s):  
Formal Analysis ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Architecture Modelling

scholarly journals Understanding Hohfeld and Formalizing Legal Rights: The Hohfeldian Conceptions and Their Conditional Consequences

Studia Logica ◽  
2019 ◽  
Vol 108 (1) ◽  
pp. 129-158 ◽  
Author(s):  
Réka Markovich
Keyword(s):  
Legal Theory ◽  
Formal Analysis ◽  
Comprehensive Analysis ◽  
Legal Rights ◽  
Fundamental Theory ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Different Types ◽  
Multi Agent ◽  
Judicial Reasoning

Abstract Hohfeld’s analysis (Fundamental Legal Conceptions as Applied in Judicial Reasoning, 1913, 1917) on the different types of rights and duties is highly influential in analytical legal theory, and it is considered as a fundamental theory in AI&Law and normative multi-agent systems. Yet a century later, the formalization of this theory remains, in various ways, unresolved. In this paper I provide a formal analysis of how the working of a system containing Hohfeldian rights and duties can be delineated. This formalization starts from using the same tools as the classical ones by Kanger and Lindahl used, but instead of focusing on the algebraic features of rights and duties, it aims at providing a comprehensive analysis of what these rights and duties actually are and how they behave and at saying something substantial on Power too—maintaining all along the Hohfeldian intentions that these rights and duties are sui generis and inherently relational.

scholarly journals COMPOSITIONAL VERIFICATION OF MULTI-AGENT SYSTEMS: A FORMAL ANALYSIS OF PRO-ACTIVENESS AND REACTIVENESS

2002 ◽  
Vol 11 (01n02) ◽  
pp. 51-91 ◽  
Author(s):  
CATHOLIJN M. JONKER ◽  
JAN TREUR
Keyword(s):  
Formal Analysis ◽  
Information Gathering ◽  
Multi Agent System ◽  
Compositional Verification ◽  
Multi Agent Systems ◽  
Verification Method ◽  
Agent Systems ◽  
Information Agents ◽  
Multi Agent ◽  
Compositional Method

A compositional method is presented for the verification of multi-agent systems. The advantages of the method are the well-structuredness of the proofs and the reusability of parts of these proofs in relation to reuse of components. The method is illustrated for an example multi-agent system, consisting of co-operative information gathering agents. This application of the verification method results in a formal analysis of pro-activeness and reactiveness of agents, and shows which combinations of pro-activeness and reactiveness in a specific type of information agents lead to a successful cooperation.

scholarly journals Cooperative Information Sharing to Improve Distributed Learning in Multi-Agent Systems

2005 ◽  
Vol 24 ◽  
pp. 407-463 ◽  
Author(s):  
P. S. Dutta ◽  
N. R. Jennings ◽  
L. Moreau
Keyword(s):  
Information Sharing ◽  
Formal Analysis ◽  
Empirical Evaluation ◽  
Task Completion ◽  
Multi Agent Systems ◽  
Long Distance ◽  
State Information ◽  
Agent Systems ◽  
Systems Research ◽  
Multi Agent

Effective coordination of agents' actions in partially-observable domains is a major challenge of multi-agent systems research. To address this, many researchers have developed techniques that allow the agents to make decisions based on estimates of the states and actions of other agents that are typically learnt using some form of machine learning algorithm. Nevertheless, many of these approaches fail to provide an actual means by which the necessary information is made available so that the estimates can be learnt. To this end, we argue that cooperative communication of state information between agents is one such mechanism. However, in a dynamically changing environment, the accuracy and timeliness of this communicated information determine the fidelity of the learned estimates and the usefulness of the actions taken based on these. Given this, we propose a novel information-sharing protocol, post-task-completion sharing, for the distribution of state information. We then show, through a formal analysis, the improvement in the quality of estimates produced using our strategy over the widely used protocol of sharing information between nearest neighbours. Moreover, communication heuristics designed around our information-sharing principle are subjected to empirical evaluation along with other benchmark strategies (including Littman's Q-routing and Stone's TPOT-RL) in a simulated call-routing application. These studies, conducted across a range of environmental settings, show that, compared to the different benchmarks used, our strategy generates an improvement of up to 60% in the call connection rate; of more than 1000% in the ability to connect long-distance calls; and incurs as low as 0.25 of the message overhead.

Sign in / Sign up

Export Citation Format

Share Document