Electronic markets, dispute resolution and negotiation protocols are three types of application domains that can be viewed as open agent societies. Key characteristics of such societies are agent heterogeneity, conflicting individual goals and unpredictable behavior. Members of such societies may fail to, or even choose not to, conform to the norms governing their interactions. It has been argued that systems of this type should have a formal, declarative, verifiable, and meaningful semantics. We present a theoretical and computational framework being developed for the executable specification of open agent societies. We adopt an external perspective and view societies as instances of normative systems. In this article, we demonstrate how the framework can be applied to specifying and executing a contract-net protocol. The specification is formalized in two action languages, the
C
+ language and the Event Calculus, and executed using respective software implementations, the Causal Calculator and the Society Visualizer. We evaluate our executable specification in the light of the presented case study, discussing the strengths and weaknesses of the employed action languages for the specification of open agent societies.
E-markets and negotiation protocols are two types of application domains that can be viewed as open computational societies. Key characteristics of such societies are agent heterogeneity, conflicting individual goals and limited trust. The risk that members of such societies will not conform to specifications imposes the need for a framework that will facilitate the designers to determine to what extent it is desirable to deploy their agents in such societies. We address this need by presenting a formal framework for specifying, animating, and ultimately reasoning about and verifying the properties of open computational systems. We view computational systems from an external perspective, aiming to account for the institutional and social aspects of these systems. We identify the key concepts and illustrate how they are used by formalising an example employing the contract net protocol. The framework and associated logical inferences have been implemented as a software platform that provides automated animation of the global states of an open system (society) during its execution. Simulations have demonstrated that the implementation of the framework establishes a foundation for a rich, formal representation of open computational societies.
The so-called fourth industrial revolution and its economic and societal implications are no longer solely an academic concern, but a matter for political as well as public debate. Characterized as the convergence of robotics, AI, autonomous systems and information technology-or cyber-physical systems-the fourth industrial revolution was the focus of the World Economic Forum, at Davos, in 2016 [1]. Also in 2016 the US White House initiated a series of public workshops on artificial intelligence (AI) and the creation of an interagency working group, and the European Parliament Committee for Legal Affairs published a draft report with recommendations to the Commission on Civil Law Rules on Robotics.
We address the problem of engineering self-organizing electronic institutions for resource allocation in open, embedded, and resource-constrained systems. In such systems, there is decentralized control, competition for resources and an expectation of both intentional and unintentional errors. The "optimal" distribution of resources is then less important than the endurance of the distribution mechanism. Under these circumstances, we propose to model resource allocation as a common-pool resource management problem, and develop a formal characterization of Elinor Ostrom's socio-economic principles for self-governing institutions. This article applies a method for sociologically inspired computing to give a complete axiomatization of six of Ostrom's eight principles in the Event Calculus. A testbed is implemented for experimenting with the axiomatization. The experimental results show that these principles support enduring institutions, in terms of longevity and membership, and also provide insight into calibrating the transaction and running costs associated with implementing the principles against the behavioral profile of the institutional membership. We conclude that it is possible to express Ostrom's principles in logical form and that they are necessary and sufficient conditions for enduring self-organizing electronic institutions to manage sustainable common-pool resources.
Open multi-agent computational systems are composed of heterogeneous and possibly antagonistic software entities. Characteristic features are limited trust and unpredictable behaviour. Members of such systems may fail to, or even choose not to, conform to the norms governing their interactions. It has been argued that systems of this type should have a formal, declarative, verifiable, and meaningful semantics. We present a theoretical and computational framework being developed for the executable specification of such systems. We adopt an external perspective and view open computational systems as instances of normative systems. In this paper we demonstrate how the framework can be applied to specifying and executing an argumentation protocol based on Brewka's reconstruction of Rescher's theory of formal disputation. The specification is formalised in the action language C + and executed using the 'Causal Calculator' (Ccalc) implementation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.