In this article we present an engineering approach for the integration of social group dynamics in the behavior modeling of multiagent systems. To this end, a toolbox was created that brings together several theories from the social sciences, each focusing on different aspects of group dynamics. Due to its modular approach, the toolbox can either be used as a central control component of an application or it can be employed temporarily to rapidly test the feasibility of the incorporated theories (...) for a given application domain. This is exemplified by applying the toolbox to different applications. (shrink)

Consensus of fractional-order multiagent systems with single integral has been wildly studied. However, the dynamics with multiple integral also exist in FOMASs, and they are rarely studied at present. In this paper, consensus problems for multi-integral fractional-order multiagent systems with nonuniform time-delays are addressed. The consensus conditions for MIFOMASs are obtained by a novel frequency-domain method which properly eliminates consensus problems of the systems associated with nonuniform time-delays. Besides, the method revealed in this paper is applicable to classical (...) high-order multiagent systems which is a special case of MIFOMASs. Finally, several numerical simulations with different parameters are performed to validate the correctness of the results. (shrink)

Consensus of fractional-order multiagent systems with single integral has been wildly studied. However, the dynamics with multiple integral also exist in FOMASs, and they are rarely studied at present. In this paper, consensus problems for multi-integral fractional-order multiagent systems with nonuniform time-delays are addressed. The consensus conditions for MIFOMASs are obtained by a novel frequency-domain method which properly eliminates consensus problems of the systems associated with nonuniform time-delays. Besides, the method revealed in this paper is applicable to classical (...) high-order multiagent systems which is a special case of MIFOMASs. Finally, several numerical simulations with different parameters are performed to validate the correctness of the results. (shrink)

In this paper, we discuss guidelines for a reward design problem that defines when and what amount of reward should be given to the agent/s, within the context of reinforcement learning approach. We would like to take keepaway soccer as a standard task of the multiagent domain which requires skilled teamwork. The difficulties of designing reward for this task are due to its features as follows: i) since it belongs to the continuing task which has no explicit goal to (...) achieve, it is hard to tell when reward should be given to the agent/s. ii) since it is a multiagent cooperative task, it is hard to decide what is a fair share of reward for each agent's contribution to achieve the goal. Through some experiments, we show that the reward design have a major effect on the agent's behavior, and introduce the successful reward function that makes agents perform keepaway better and more interesting than the conventional one does. Finally, we explore the relationship between `reward design' and `acquired behaviors' from the viewpoint of teamwork. (shrink)

Konolige''s technical notion of belief based on deduction structures is briefly reviewed and its usefulness for the design of artificial agents with limited representational and deductive capacities is pointed out. The design of artificial agents with more sophisticated representational and deductive capacities is then taken into account. Extended representational capacities require in the first place a solution to the intensional context problems. As an alternative to Konolige''s modal first-order language, an approach based on type-free property theory is proposed. It considers (...) often neglected issues, such as the need for a more general account of thede dicto-de re distinction, and quasi-indicators. Extended deductive capacities require a subdivision of Konolige''s notion of belief into two distinct technical notions,potential anddispositional belief. The former has to do with what an artificial agent could in principle come to actively believe, given enough time and its specific logical competence; the latter with what an agent can be assumed to believe with respect to a specific goal to be fulfilled. (shrink)

Reasoning about change is a central issue in research on human and robot planning. We study an approach to reasoning about action and change in a dynamic logic setting and provide a solution to problems which are related to the Frame problem. Unlike most work on the frame problem the logic described in this paper is monotonic. It (implicitly) allows for the occurrence of actions of multiple agents by introducing non-stationary notions of waiting and test. The need to state a (...) large number of frame axioms is alleviated by introducing a concept of chronological preservation to dynamic logic. As a side effect, this concept permits the encoding of temporal properties in a natural way. We compare the relative merits of our approach and non-monotonic approaches as regards different aspects of the frame problem. Technically, we show that the resulting extended systems of propositional dynamic logic preserve (weak) completeness, finite model property and decidability. (shrink)

We consider Effort Games, a game-theoretic model of cooperation in open environments, which is a variant of the principal-agent problem from economic theory. In our multiagent domain, a common project depends on various tasks; carrying out certain subsets of the tasks completes the project successfully, while carrying out other subsets does not. The probability of carrying out a task is higher when the agent in charge of it exerts effort, at a certain cost for that agent. A central authority, (...) called the principal, attempts to incentivize agents to exert effort, but can only reward agents based on the success of the entire project.We model this domain as a normal form game, where the payoffs for each strategy profile are defined based on the different probabilities of carrying out each task and on the boolean function that defines which task subsets complete the project, and which do not. We view this boolean function as a simple coalitional game, and call this game the underlying coalitional game. We suggest the Price of Myopia as a measure of the influence the model of rationality has on the minimal payments the principal has to make in order to motivate the agents in such a domain to exert effort.We consider the computational complexity of testing whether exerting effort is a dominant strategy for an agent, and of finding a reward strategy for this domain, using either a dominant strategy equilibrium or using iterated elimination of dominated strategies. We show these problems are generally #P-hard, and that they are at least as computationally hard as calculating the Banzhaf power index in the underlying coalitional game. We also show that in a certain restricted domain, where the underlying coalitional game is a weighted voting game with certain properties, it is possible to solve all of the above problems in polynomial time. We give bounds on PoM in weighted voting effort games, and provide simulation results regarding PoM in another restricted class of effort games, namely effort games played over Series-Parallel Graphs. (shrink)

The interface between mental health services and the criminal justice system presents challenges both for professionals and patients. Both systems are stressed and inherently complex. Section 136 of the Mental Health Act is unusual being both an aspect of the Mental Health Act and a power of arrest. It has a long and controversial history related to concerns about who has been detained and how the section was applied. More recently, Section 136 has had a public profile stemming from the (...) use of police cells as places of safety for young, mentally disturbed individuals. This paper explores the current state of health of this piece of legislation. Specifically, we consider whether alternative approaches are more suitable for those individuals in crisis and/or distress who come into contact with the police. This requires careful thought as to the proper role of both health and criminal justice professionals who are daily grappling with an ethically contentious domain of multiagency work. (shrink)

In this paper we investigate the role of information machines in the scientific enterprise intended as a social activity. Our discussion is based on a powerful kind of information machines called scientific social agencies, which are multiagent systems of distributed artificial intelligence. Scientific social agency, on the one hand, can provide great benefits to the present common scientific practice but, on the other hand, its development represents a strong and still open technical challenge. This paper shows a coherent framework (...) in which scientific social agency is settled. Moreover, the double role of a scientific social agency in assisting scientists in their activity and in representing the products of their research is illustrated by means of some examples. (shrink)

Designing models of complex phenomena is a difficult task in engineering that can be tackled by composing a number of partial models to produce a global model of the phenomena. We propose to embed the partial models in software agents and to implement their composition as a cooperative negotiation between the agents. The resulting multiagent system provides a global model of a phenomenon. We applied this approach in modelling two complex physiological processes: the heart rate regulation and the glucose-insulin (...) metabolism. Beyond the effectiveness demonstrated in these two applications, the idea of using models associated to software agents to give reason of complex phenomena is in accordance with current tendencies in epistemology, where it is evident an increasing use of computational models for scientific explanation and analysis. Therefore, our approach has not only a practical, but also a theoretical significance: agents embedding models are a technology suitable both to representing and to investigating reality. (shrink)

The consensus problem is presented for the switched multiagent system, where the MAS is switched between continuous- and discrete-time systems with relative state constraints. With some standard assumptions, we obtain the fact that the switched MAS with relative state constraints can achieve consensus under both fixed undirected graphs and switching undirected graphs. Furthermore, based on the absolute average value of initial states, we propose sufficient conditions for consensus of the switched MAS. The challenge of this study is that relative (...) state constraints are considered, which will make the consensus problem much more complex. One of the main contributions is that, for the switched MAS with relative state constraints, we explore the solvability of the consensus problem. Finally, we present two simulation examples to show the effectiveness of the results. (shrink)

Source domain verification has not received as much attention as criteria for metaphor identification in the study of conceptual metaphor. In this paper, we provide a replicable approach to source...

In this paper, I discuss two concerns for pluralist truth theories: a concern about a key detail of these theories and a concern about their viability. The detail-related concern is that pluralists have relied heavily upon the notion of a domain, but it is not transparent what they take domains to be. Since the notion of a domain has been present in philosophy for some time, it is important for many theorists, not only truth pluralists, to be clear on (...) what domains are and what work they can do. The viability-related concern is that it’s not clear how a pluralist truth theory could explain the truth-conditions of mixed atomic propositions. To address this concern, truth pluralists should recognize something to which they have not been sufficiently attentive: that some atomic propositions belong to more than one domain. But, recognizing this requires rethinking the relationships between the nature of propositions, their membership in domains, and their truth. I address these issues and propose an understanding of them that is preferable to the best existing account of them, that offered by Michael Lynch. (shrink)

Crisis management is a complex problem raised by the scientific community currently. Decision support systems are a suitable solution for such issues, they are indeed able to help emergency managers to prevent and to manage crisis in emergency situations. However, they should be enough flexible and adaptive in order to be efficient to solve complex problems that are plunged in dynamic and unpredictable environments. The approach we propose in this paper addresses this challenge. First, we expose a modelling of information (...) for an emergency environment. Then, we describe an architecture of a multiagent DSS that deals with these information in order to prevent and to manage crisis situations. We focus here on the first level of the system mechanism which intends to perceive and to reflect the evolution of the current situation. Finally, we provide an implementation and an experimentation of the approach using the RoboCupRescue Simulation System. (shrink)

Agent Communication Languages (ACLs) have recently acquired a primary role in open multiagent systems, which need a standard communication framework shared by all interacting heterogeneous agents. According to the most important ACL standard proposals so far, agents are supposed to carry out the communication process by performing actions of a specific type, namely, communicative acts, whose semantics is defined in terms of the agents’ mental states. Although following the mainstream guidelines inspired by the Speech Act Theory, our work illustrates (...) an alternative model of agent communication, by shifting the focus from agents’ mental states to their social state. Taking an existing communicative act library, we provide a semantics for a significant set of acts based on the concept of commitment, and prove that our approach tackles some issues that have not been dealt with in an effective way yet and that may have hindered the rise of an universally accepted ACL standard. (shrink)

Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between semantics and logics . Moreover, the underlying (...) logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e., properties which can be determined to hold of a process on the basis of a finite amount of information about its execution.These ideas lead to the following programme. A metalanguage is introduced, comprising• types = universes of discourse for various computational situations;• terms = PROGRAMS = syntactic intensions for models or points. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatises the properties they satisfy. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism. This opens the way to a whole range of applications. Given a denotational description of a computational situation in our metalanguage, we can turn the handle to obtain a logic for that situation. (shrink)

This book is about normativity and reasons.

Metacognition is the capacity to evaluate the success of one's own cognitive processes in various domains; for example, memory and perception. It remains controversial whether metacognition relies on a domain-general resource that is applied to different tasks or if self-evaluative processes are domain specific. Here, we investigated this issue directly by examining the neural substrates engaged when metacognitive judgments were made by human participants of both sexes during perceptual and memory tasks matched for stimulus and performance characteristics. By comparing (...) patterns of fMRI activity while subjects evaluated their performance, we revealed both domain-specific and domain-general metacognitive representations. Multivoxel activity patterns in anterior prefrontal cortex predicted levels of confidence in a domain-specific fashion, whereas domain-general signals predicting confidence and accuracy were found in a widespread network in the frontal and posterior midline. The demonstration of domain-specific metacognitive representations suggests the presence of a content-rich mechanism available to introspection and cognitive control. (shrink)

We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence (...) and uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chaos; we also show how efficient algorithms have been obtained for computing elementary functions in exact real arithmetic. (shrink)

This paper addresses variable-time impulsive control for coordinated tracking problem in nonlinear multiagent systems. To make followers coordinately track the leader, a variable-time impulsive controller is designed. Under some well-selected conditions, the comparison system of variable-time impulsive tracking control system is constructed by employing B-equivalence method. And we theoretically demonstrate that the two systems have the same stability property. Coordinated tracking criteria of multiagent systems are obtained by considering the comparison system. Numerical simulation is also provided to illustrate (...) the correctness of theoretical results and the efficiency of the variable-time impulsive controller. (shrink)

In this note we exhibit a continuity principle for real-valued functions on C[–1, 1] that is not validated by realizability over domains although it is validated by Kleene's functional realizability corresponding to Weihrauch's theory of type 2 effectivity.

In a multiagent and multi-cultural world, the fine-grained analysis of agents’ dynamic behaviour, i.e. of their activities, is essential. Dynamic activities are actions that are characterized by an agent who executes the action and by other participants of the action. Wh-questions on the participants of the actions pose a difficult particular challenge because the variability of the types of possible answers to such questions is huge. To deal with the problem, we propose the analysis and classification of Wh-questions apt (...) for agents’ communication in a multiagent system (MAS). Our proposal of such a system consists of agents who communicate with their fellow agents by messaging so that each autonomous agent, though resource-bounded, can make less or more rational decisions to meet its own and collective goals. In addition, by communicating with other fellow agents and their environment, agents can learn new concepts and enrich their ontology so that their behaviour is dynamic. We aim to make a general proposal of the system so that the ‘envelope’ of agents’ messages can be formalized in any MAS standard, be it The Foundation for Intelligent Physical Agents - Agent Communication Language (FIPA-ACL) or Knowledge Query and Manipulation Language (KQML). Yet, the content of messages is encoded in a formalized natural language. To this end, we apply Transparent Intensional Logic (TIL) with its procedural semantics which is particularly apt for a fine-grained analysis in which all the semantically salient features of natural language can be plausibly formalized. In this paper, we concentrate on analysing the content of query messages, particularly the content of those that encode Wh-questions and the answers to them. We also summarize TIL deduction system that makes it possible to answer such questions in an intelligent way. Linguists distinguish several subtypes of Wh-questions. Though the linguistic classification is helpful, it is not always suitable for agents’ communication and reasoning. We need the classification based on a logical analysis of Wh-questions so that the agents can infer possible answers to such questions rather than only looking for them by keywords. This paper aims to apply an appropriate classification of the logical types of Wh-questions and the analysis of such questions; we concentrate in particular on questions concerning the participants of activities. The application of these results to the analysis of processes and events based on verb valency frames is another novelty of the paper. (shrink)

Domain extension in mathematics occurs whenever a given mathematical domain is augmented so as to include new elements. Manders argues that the advantages of important cases of domain extension are captured by the model-theoretic notions of existential closure and model completion. In the specific case of domain extension via ideal elements, I argue, Manders’s proposed explanation does not suffice. I then develop and formalize a different approach to domain extension based on Dedekind’s Habilitationsrede, to which Manders’s account is compared. I (...) conclude with an examination of three possible stances towards extensions via ideal elements. (shrink)

Cross-domain descriptions are descriptions of features pertaining to one domain in terms of vocabulary primarily associated with another domain. Notably, we routinely describe psychological features in terms of the sensory domain and vice versa. Sorrow is said to be ‘bitter’ and fear ‘cold’. Music can be described as ‘happy’, ‘sad’, ‘mournful’, and so on. Such descriptions are rife in both everyday discourse and literary writings. What is it about psychological features that invites descriptions in sensory terms and what is it (...) about the sensory that invites descriptions in terms of the psychological? Drawing on the literature on polysemy, this paper sheds light on cross-domain descriptions pertaining to the sensory and the psychological domains. (shrink)