When agents know a protocol, this leads them to have expectations about future observations. Agents can update their knowledge by matching their actual observations with the expected ones. They eliminate states where they do not match. In this paper, we study how agents perceive protocols that are not commonly known, and propose a semantics-driven logical framework to reason about knowledge in such scenarios. In particular, we introduce the notion of epistemic expectation models and a propositional dynamic logic-style epistemic logic (...) for reasoning about knowledge via matching agentsÊ expectations to their observations. It is shown how epistemic expectation models can be obtained from epistemic protocols. Furthermore, a characterization is presented of the effective equivalence of epistemic protocols. We introduce a new logic that incorporates updates of protocols and that can model reasoning about knowledge and observations. Finally, the framework is extended to incorporate fact-changing actions, and a worked-out example is given. © 2013 Elsevier B.V. (shrink)

In dynamical multi-agent systems, agents are controlled by protocols. In choosing a class of formal protocols, an implicit choice is made concerning the types of agents, actions and dynamics representable. This paper investigates one such choice: An intensional protocol class for agent control in dynamic epistemic logic (DEL), called ‘DEL dynamical systems’. After illustrating how such protocols may be used in formalizing and analyzing information dynamics, the types of epistemic temporal models that they may generate (...) are characterized. This facilitates a formal comparison with the only other formal protocol framework in dynamic epistemic logic, namely the extensional ‘DEL protocols’. The paper concludes with a conceptual comparison, highlighting modeling tasks where DEL dynamical systems are natural. (shrink)

In dynamical multi-agent systems, agents are controlled by protocols. In choosing a class of formal protocols, an implicit choice is made concerning the types of agents, actions and dynamics representable. This paper investigates one such choice: An intensional protocol class for agent control in dynamic epistemic logic, called ‘DEL dynamical systems’. After illustrating how such protocols may be used in formalizing and analyzing information dynamics, the types of epistemic temporal models that they may generate are (...) characterized. This facilitates a formal comparison with the only other formal protocol framework in dynamic epistemic logic, namely the extensional ‘DEL protocols’. The paper concludes with a conceptual comparison, highlighting modeling tasks where DEL dynamical systems are natural. (shrink)

This paper analyzes the investigation of the distribution of the protein tenascin-C in canine mammary tumors. The method involved immunohistochemistry of tissue slices, performed by the application of an antibody to tenascin-C that specifically can be made visible for microscopic inspection. The first phase of the project is the making of the protocol, the second the deduction of a pattern of tenascin-C distribution in tumors and the third the writing of a paper. Each of the phases is analyzed separately, using (...) the concept of resistance and accommodation. My purpose is to show that in each phase of the process of producing knowledge, the scientist meets resistances which force him to accommodate by changing his conceptual, technical and methodological approaches. In reverse, the details of the non-human agent have to be accommodated to the wishes and expectations of the scientist. Through this interaction a situation of stability of knowledge is reached at the end of each phase.In the protocol phase, resistance is found in the antibody and tissue slices. In the phase of pattern deduction the resistance is in the pathological diagnosis of the tumors and the expectations and hypothesis with which the scientist had entered the project; in the criteria to be used for assigning the slices to a tenascin-C pattern; and in the responses of colleagues and supervisor. In the paper-writing phase the interaction is between the scientist and the scientific community which should take on board the knowledge from the research project.When stabilization of knowledge is obtained in one of the phases, the agents of resistance turn into allies in the next phase, giving support to accommodating the resistances in this later phase. Second, the stabilization of knowledge of the protocol is further enhanced when stabilization of the pattern is achieved; in addition, knowledge of the pattern is more definite when it has become stabilized and closed knowledge within the science community. (shrink)

Epistemic protocols are communication protocols aiming at transfer of knowledge in a controlled way. Typically, the preconditions or goals for protocol actions depend on the knowledge of agents, often in nested form. Informal epistemic protocol descriptions for muddy children, coordinated attack, dining cryptographers, Russian cards, secret key exchange are well known. The contribution of this paper is a formal study of a natural requirement on epistemic protocols, that the contents of the protocol can be assumed to be (...) common knowledge. By formalizing this requirement we can prove that there can be no unbiased deterministic protocol for the Russian cards problem. For purposes of our formal analysis we introduce an epistemic protocol language, and we show that its model checking problem is decidable. (shrink)

We introduce and study a PDL-style logic for reasoning about protocols, or plans, under imperfect information. Our paper touches on a number of issues surrounding the relationship between an agent’s abilities, available choices, and information in an interactive situation. The main question we address is under what circumstances can the agent commit to a protocol or plan, and what can she achieve by doing so?

We present a generic denotational semantic framework for protocols for dialogs between rational and autonomous agents over action which allows for retraction and revocation of proposals for action. The semantic framework views participants in a deliberation dialog as jointly and incrementally manipulating the contents of shared spaces of action-intention tokens. The framework extends prior work by decoupling the identity of an agent who first articulates a proposal for action from the identity of any agent then empowered to (...) retract or revoke the proposal, thereby permitting proposals, entreaties, commands, promises, etc., to be distinguished semantically. (shrink)

We study a logic for reasoning about agents that pass messages according to a protocol. Protocols are specified extensionally, as sets of sequences of ?legal? actions assigned to each state in a Kripke model. Message-passing events that are licensed by the protocol are modeled as updates in the style of dynamic epistemic logic. We also consider changes to the protocol by introducing message-encoding modalities, corresponding to communications actions that lead to protocol extensions. While in our general framework, messages are (...) arbitrary objects, we also consider the case that the messages that are passed are sentences of the object language itself. We present complete calculi for our logics and clarify the relationship of our proposal to earlier work on public announcement logic. (shrink)

We present a model-theoretic approach for reasoning about security protocols, applying recent insights from dynamic epistemic logics. This enables us to describe exactly the subsequent epistemic states of the agents participating in the protocol, using Kripke models and transitions between these based on updates of the agent's beliefs associated with steps in the protocol. As a case study we will consider the SRA Three Pass protocol and discuss the Wide-Mouthed Frog protocol.

We describe PADUA, a protocol designed to support two agents debating a classification by offering arguments based on association rules mined from individual datasets. We motivate the style of argumentation supported by PADUA, and describe the protocol. We discuss the strategies and tactics that can be employed by agents participating in a PADUA dialogue. PADUA is applied to a typical problem in the classification of routine claims for a hypothetical welfare benefit. We particularly address the problems that arise from the (...) extensive number of misclassified examples typically found in such domains, where the high error rate is a widely recognised problem. We give examples of the use of PADUA in this domain, and explore in particular the effect of intermediate predicates. We have also done a large scale evaluation designed to test the effectiveness of using PADUA to detect misclassified examples, and to provide a comparison with other classification systems. (shrink)

Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents. Since BAN-logic, there have been several initiatives and attempts to incorpórate epistemics into the analysis of security protocols. In this paper, we give an overview of work in the field and present it in a unified perspective, with comparisons on technical subtleties that have been employed in different approaches. Also, we study to which degree the use of epistemics is essential for the analysis (...) of security protocols. We look for formal conditions under which knowledge modalities can bring extra expressive power to pure temporal languages. On the other hand, we discuss the cost of the epistemic operators in terms of model checking complexity. (shrink)

Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that greatly complicate or even prevent their applicability in some important cases. For instance, most techniques assume that communication between honest principals is controlled by a Dolev-Yao intruder, i.e. a malicious agent capable to overhear, divert, and fake messages. Yet we might be interested in establishing the security of a protocol that relies on a less unsecure channel (...) (e.g. a confidential channel provided by some other protocol sitting lower in the protocol stack). In this paper we propose a general model for security protocols based on the set-rewriting formalism that, coupled with the use of LTL, allows for the specification of assumptions on principals and communication channels as well as of complex security properties that are normally not handled by state-of-the-art security protocol analysers. By using our approach we have been able to formalise all the assumptions required by the ASW protocol for optimistic fair exchange and some of its key security properties. Besides the previously reported attacks on the protocol, we report a new attack on a patched version of the protocol. (shrink)

Two areas of importance for agents and multiagent systems are investigated: design of agent programming languages, and design of agent communication languages. The paper contributes in the above mentioned areas by demonstrating improved or novel applications for deontic logic and normative reasoning. Examples are taken from computer-supported cooperative work, and electronic commerce.

A gossip protocol is a procedure for sharing secrets in a network. The basic action in a gossip protocol is a pairwise message exchange (telephone call) wherein the calling agents exchange all the secrets they know. An agent who knows all secrets is an expert. The usual termination condition is that all agents are experts. Instead, we explore protocols wherein the termination condition is that all agents know that all agents are experts. We call such agents super experts. (...) We also investigate gossip protocols that are common knowledge among the agents. Additionally, we model that agents who are super experts do not make and do not answer calls, and that this is common knowledge. We investigate conditions under which protocols terminate, both in the synchronous case, where there is a global clock, and in the asynchronous case, where there is not. We show that a commonly known protocol with engaged agents may terminate faster than the same commonly known protocol without engaged agents. (shrink)

This paper investigates the event-based consensus problem for the heterogeneous hybrid multiagent system. First, the heterogeneous hybrid MAS is proposed which contains continuous and discrete-time subsystems with second-order and first-order heterogeneous dynamics. Second, the event-triggered protocols are proposed, which mainly include the event-based control laws and event-triggered conditions for different kinds of agents. Then, the consensus conclusions of fixed topology and switching topologies are obtained based on graph theory and nonnegative matrix theory, which include the constraints on control parameters, (...) coupling gains, and sampling interval to guarantee consensus. Finally, a simulation example is given to verify the efficiency of the proposed protocols. (shrink)

This paper outlines a multi-agent architecture for regulated information exchange of crime investigation data between police forces. Interactions between police officers about information exchange are analysed as negotiation dialogues with embedded persuasion dialogues. An architecture is then proposed consisting of two agents, a requesting agent and a responding agent, and a communication language and protocol with which these agents can interact to promote optimal information exchange while respecting the law. Finally, dialogue policies are defined for the individual (...) agents, specifying their behaviour within a negotiation. Essentially, when deciding to accept or reject an offer or to make a counteroffer, an agent first determines whether it is obligatory or permitted to perform the actions specified in the offer. If permitted but not obligatory, the agent next determines whether it is in his interest to accept the offer. (shrink)

This paper outlines a multi-agent architecture for regulated information exchange of crime investigation data between police forces. Interactions between police officers about information exchange are analysed as negotiation dialogues with embedded persuasion dialogues. An architecture is then proposed consisting of two agents, a requesting agent and a responding agent, and a communication language and protocol with which these agents can interact to promote optimal information exchange while respecting the law. Finally, dialogue policies are defined for the individual (...) agents, specifying their behaviour within a negotiation. Essentially, when deciding to accept or reject an offer or to make a counteroffer, an agent first determines whether it is obligatory or permitted to perform the actions specified in the offer. If permitted but not obligatory, the agent next determines whether it is in his interest to accept the offer. (shrink)

The literature in agent-based social simulation suggests that a model is validated when it is shown to ‘successfully’, ‘adequately’ or ‘satisfactorily’ represent the target phenomenon. The notion of ‘successful’, ‘adequate’ or ‘satisfactory’ representation, however, is both underspecified and difficult to generalise, in part, because practitioners use a multiplicity of criteria to judge representation, some of which are not entirely dependent on the testing of a computational model during validation processes. This article argues that practitioners should address social epistemology to (...) achieve a deeper understanding of how warrants for belief in the adequacy of representation are produced. Two fundamental social processes for validation: interpretation and commensuration, are discussed to justify this claim. The analysis is advanced with a twofold aim. First, it shows that the conceptualisation of validation could greatly benefit from incorporating elements of social epistemology, for the criteria used to judge adequacy of representation are influenced by the social, cognitive and physical organisation of social simulation. Second, it evidences that standardisation tools such as protocols and frameworks fall short in accounting for key elements of social epistemology that affect different instances of validation processes. (shrink)

Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent’s internal state, are often classified as ‘open’. The members of such systems may inadvertently fail to, or even deliberately choose not to, conform to the system specification. Consequently, it is necessary to specify the normative relations that may exist between the members, such as permission, obligation, and institutional power. We present a framework being developed for executable specification (...) of open multi-agent systems. We adopt a bird’s eye view of these systems, as opposed to an agent’s perspective whereby it reasons about how it should act. This paper is devoted to the presentation of various examples from the NetBill protocol formalised in terms of institutional power, permission and obligation. We express the system specification in the Event Calculus and execute the specification by means of a logic programming implementation. We also give several example formalisations of sanctions for dealing with violations of permissions and obligations. We distinguish between an open multi-agent system and the procedure by which an agent enters and leaves the system. We present examples from the specification of a role-management protocol for NetBill, and demonstrate the interplay between such a protocol and the corresponding multi-agent system. (shrink)

Recent mutagenesis studies have demonstrated that the chemotherapeutic agent, chlorambucll (CHL), is highly mutagenic in male germ cells of the mouse. Post‐melotic germ cells, and especially early spermatids, are the most sensitive to the cytotoxic and mutagenic effects of this agent. Genetic, cytogenetic and molecular analyses of many induced mutations have shown that, in these germ‐cell stages, CHL induces predominantly chromosomal rearrangements (deletions and translocations), and mutation‐rate studies show that, in terms of tolerated doses, CHL is perhaps five (...) to ten times more efficient in inducing rearrangements than is radiation exposure. Appropriate breeding protocols, along with knowledge of the advantages and limitations associated with the use of CHL, can be used to expand the current resource of chromosomal rearrangements in the mouse and to provide new phenotype‐associated mutations amenable to positional‐cloning techniques. The analysis of CHL‐induced mutations has also contributed to understanding the factors that affect the yield and nature of chemically induced germline mutations in mammals. (shrink)

The ethical authority carried in the conventions of fairness and human well-being has been widely adopted under the idea of “moral economy,” forming an eclectic and interdisciplinary debate. Significant, though external to this debate, is a corpus of medieval thought which exhibits a fundamental interest in legitimate market protocols, and the political rights and obligations of agents in relation to the common good of the community. This article asserts the imperative status of a customary basis for understanding not just (...) the analytic version of moral economy but the legacy contained in what might be termed the “the moral economy of Aquinas.”. (shrink)

The situation calculus is a logical formalism that has been extensively developed for planning. We apply the formalism in a complex multi-agent domain, modelled on the game of Clue. We find that the situation calculus, with suitable extensions, supplies a unified representation of (1) the interaction protocol, or structure of the game, (2) the dynamics of the knowledge and common knowledge of the agents, and (3) principles of strategic planning.

This paper investigates the leaderless and leader-follower time-varying formation design and analysis problems for a group of networked agents subject to discontinuous communications. Firstly, a leaderless time-varying formation control protocol is proposed via the intermittent control strategy, where the control input of each agent is constructed by the distributed local state information and formation instructions in the communication time unit, but it is zero in the noncommunication time unit. Then, an explicit formulation of the formation center function is determined (...) to describe the formation movement trajectory of the whole networked agents. Leaderless time-varying formation design and analysis with discontinuous communications are given in the form of linear matrix inequalities. Moreover, the main results of the leaderless cases are extended to the leader-follower cases. Finally, two numerical examples are provided to illustrate the theoretical results of leaderless and leader-follower cases, respectively. (shrink)

Using a knowledge-based approach, we derive a protocol, MACOM1, for the sequence transmission problem from one agent to a group of agents. The protocol is correct for communication media where deletion and reordering errors may occur. Furthermore, it is shown that after k rounds the agents in the group attain depth k general knowledge about the members of the group and the values of the messages. Then, we adjust this algorithm for multi-agent communication for the process of teamwork. (...) MACOM1 solves the sequence transmission problem from one agent to a group of agents, but does not fully comply with the type of dialogue communication needed for teamwork. The number of messages being communicated per communication between the initiator and the other agents from the group can differ. Furthermore, the teamwork process can require the communication algorithm to handle changes of initiator. We show the adjustments that have to be made to MACOM1 to handle these properties of teamwork. For the new multi-agent communication algorithm, MACOM2, it is shown that the gaining of knowledge required for a successful teamwork process is still guaranteed. (shrink)

Understanding the flow of knowledge in multi-agent protocols is essential when proving the correctness or security of such protocols. Current logical approaches, often based on model checking, are well suited for modeling knowledge in systems where agents do not act strategically. Things become more complicated in strategic settings. In this paper we show that such situations can be understood as a special type of game – a knowledge condition game – in which a coalition “wins” if it (...) is able to bring about some epistemic condition. This paper summarizes some results relating to these games. Two proofs are presented for the computational complexity of deciding whether a coalition can win a knowledge condition game with and without opponents (Σ2P-complete and NP-complete respectively). We also consider a variant of knowledge condition games in which agents do not know which strategies are played, and prove that under this assumption, the presence of opponents does not affect the complexity. The decision problem without opponents is still NP-complete, but requires a different proof. (shrink)

Understanding the flow of knowledge in multi-agent protocols is essential when proving the correctness or security of such protocols. Current logical approaches, often based on model checking, are well suited for modeling knowledge in systems where agents do not act strategically. Things become more complicated in strategic settings. In this paper we show that such situations can be understood as a special type of game – a knowledge condition game – in which a coalition “wins” if it (...) is able to bring about some epistemic condition. This paper summarizes some results relating to these games. Two proofs are presented for the computational complexity of deciding whether a coalition can win a knowledge condition game with and without opponents (Σ2P-complete and NP-complete respectively). We also consider a variant of knowledge condition games in which agents do not know which strategies are played, and prove that under this assumption, the presence of opponents does not affect the complexity. The decision problem without opponents is still NP-complete, but requires a different proof. (shrink)

Computers are already approving financial transactions, controlling electrical supplies, and driving trains. Soon, service robots will be taking care of the elderly in their homes, and military robots will have their own targeting and firing protocols. Colin Allen and Wendell Wallach argue that as robots take on more and more responsibility, they must be programmed with moral decision-making abilities, for our own safety. Taking a fast paced tour through the latest thinking about philosophical ethics and artificial intelligence, the authors (...) argue that even if full moral agency for machines is a long way off, it is already necessary to start building a kind of functional morality, in which artificial moral agents have some basic ethical sensitivity. But the standard ethical theories don't seem adequate, and more socially engaged and engaging robots will be needed. As the authors show, the quest to build machines that are capable of telling right from wrong has begun. -/- Moral Machines is the first book to examine the challenge of building artificial moral agents, probing deeply into the nature of human decision making and ethics. (shrink)

We investigate the semantics of messages, and argue that the meaning ofa message is naturally and usefully given in terms of how it affects theknowledge of the agents involved in the communication. We note thatthis semantics depends on the protocol used by the agents, and thus not only the message itself, but also the protocol appears as a parameter in the meaning. Understanding this dependence allows us to give formal explanations of a wide variety of notions including language dependence, implicature, (...) and the amount of information in a message. (shrink)

An ascending-bid auction protocol with a fixed end time has been widely used in many Internet auction sites. In such auctions, we can observe bidders’ behavior called last minute bidding, namely, a large fraction of bids are submitted in the closing seconds of the auction. This may cause a problem of information revelation failure as well as a problem of the server’s overload and network congestion. If almost all bids are submitted only during the last minute, each bidder cannot obtain (...) information about the good through others’ bidding behavior, which will spoil the advantage of open-bid auctions. This results in having an inefficient allocation of the good. To solve this problem, we propose a new protocol that gives bidders an incentive to fix the maximum bid of a proxy agent. We examine the property of the protocol by using game theory and clarify which situations our protocol outperforms the existing protocol by using a computer simulation. (shrink)

Advancements and deployments of AI-based systems, especially Deep Learning-driven generative language models, have accomplished impressive results over the past few years. Nevertheless, these remarkable achievements are intertwined with a related fear that such technologies might lead to a general relinquishing of our lives’s control to AIs. This concern, which also motivates the increasing interest in the eXplainable Artificial Intelligence (XAI) research field, is mostly caused by the opacity of the output of deep learning systems and the way that it is (...) generated, which is largely obscure to laypeople. A dialectical interaction with such systems may enhance the users’ understanding and build a more robust trust towards AI. Commonly employed as specific formalisms for modelling intra-agent communications, dialogue games prove to be useful tools to rely upon when dealing with user’s explanation needs. The literature already offers some dialectical protocols that expressly handle explanations and their delivery. This paper fully formalises the novel Explanation–Question–Response (EQR) dialogue and its properties, whose main purpose is to provide satisfactory information (i.e., justified according to argumentative semantics) whilst ensuring a simplified protocol, in comparison with other existing approaches, for humans and artificial agents. (shrink)

In this paper, we propose a framework for searching information through both the WWW and a human group. Though information retrieval using a searc engine in the WWW is very useful, we can not acquire local information owned by persons and not explicitly described in text. A user knows neither where target information is in the WWW nor who knows in a human group. Thus we integrate the information retrieval in the WWW with that in a human group, develop a (...) heterogeneous information search system HERIS as a multi-agent system. We develop this framework as multi-agent system consisting of user agents and search engine agents, and use contract net protocol to communication among the agents. A user agent and a search engine agent are assigned to a user and a search engine. Each of the agents maintains a user profile and a search engine profile. When a user gives a query to a system, it selectively searches information resources consisting the WWW and user group. Finally a user acquires integrated results of a hit list from the WWW and a audio/video connection to a user who can answer the query. It was found through experimental evaluation that information retrieval using a human group as an information resource is valid and a search with HERIS has a different character from conventional search engines. (shrink)

A persistent methodological problem in primate social cognition research has been how to determine experimentally whether primates represent the internal goals of other agents or just the external goals of their actions. This is an instance of Daniel Povinelli’s more general challenge that no experimental protocol currently used in the field is capable of distinguishing genuine mindreading animals from their complementary behavior-reading counterparts. We argue that current methods used to test for internal-goal attribution in primates do not solve Povinelli’s problem. (...) To overcome the problem, a new type of experimental approach is needed, one which is supported by an alternative theoretical account of animal mindreading, called the appearance-reality mindreading (ARM) theory. We provide an outline of the ARM theory and show how it can be used to design a novel way to test for internal-goal attribution in chimpanzees. Unlike protocols currently in use, the experimental design presented here has the power, in principle and in practice, to distinguish genuine mindreading chimpanzees from those who predict others’ behavior solely on the basis of behavioral/environmental cues. Our solution to Povinelli’s problem has important consequences for a similar debate in developmental psychology over when preverbal infants should be credited with the ability to attribute internal goals. If what we argue for here in the case of nonhuman primates is sound, then the clearest tests for internal-goal attribution in infants will be those that test for attributions of discrepant or ‘false’ perceptions. (shrink)

A gossip protocolGossip protocol is a procedure for sharing secrets in a network. The basic action in a gossip protocolGossip protocol is a telephone call wherein the caller and the callee exchange all the secrets they know. An agent who knows all secrets is an expert. The usual termination condition is that all agents are experts. Instead, we explore some protocols wherein the termination condition is that all agents know that all agents are experts. We call such agents (...) super experts. Additionally, we model that agents who already know that all agents are experts, do not make and do not answer calls. We also model that such protocols are common knowledgeCommon knowledge among the agents. We investigate conditions under which such gossip protocolsGossip protocol terminate, both in the synchronous case, where there is a global clock, and in the asynchronous case, where there is not. We show that a protocol with missed calls can terminate faster than the same protocol without missed calls. (shrink)

In this paper we provide a formal analysis of the idea of normative co-ordination. We argue that this idea is based on the assumption that agents can achieve flexible co-ordination by conferring normative positions to other agents. These positions include duties, permissions, and powers. In particular, we explain the idea of declarative power, which consists in the capacity of the power-holder of creating normative positions, involving other agents, simply by proclaiming such positions. In addition, we account also for the concepts (...) of representation, namely the representatives capacity of acting in the name of his principal, and of mandate, which is the mandatees duty to act as the mandator has requested. Finally, we show how the framework can be applied to represent the contract-net protocol. Some brief remarks on future research and applications conclude this contribution. (shrink)

To introduce an archival protocol of a ‘Debate about methods in the social sciences, especially the conception of social science method represented by the Institute’, held on 17 January 1941 at the Institute of Social Research in New York, the article focuses on certain conflicts in substance and terms of discourse among members of the Institute, with special emphasis on Franz Neumann’s distinctive approaches, notwithstanding his professed loyalty to Max Horkheimer’s theory. These are seen to arise not only from Neumann’s (...) assignment as bargaining agent for the Institute and his distinctive relations with American colleagues, but also from their different orientations to the conflicted legacies of Weimar. (shrink)

This paper develops a new ascending-price multi-unit auction protocol that has following characteristics: it has an open format, sincere bidding is an equilibrium strategy even if the marginal utilities of each agent can increase and agents can submit false-name bids. False-name bids are bids submitted under fictitious names such as multiple e-mail addresses, which can be done easily in the Internet. This is the first protocol that has these two characteristics. We show that our new protocol outperforms an existing (...) protocol, which satisfies, with respect to the social surplus and the seller's revenue. (shrink)

The a Everyday language computing is a new computational paradigm that all people, from small children to aged persons, can access and use computing systems with his/her own everyday language. As a way to realize ELC, we proposed a framework of language-based operating system, and we are now working intensively to develop the fundamental part of it. In this paper, we report our status of research on LOS. One of the main components of LOS is the semiotic base, which is (...) a database of linguistic knowledge based on Systemic Functional Linguistic Theory. We explain the architecture of the semiotic base and corpus experiments conducted to determine the contents of it. A client's secretary agent is a user interface of LOS which realizes everyday language communication between a user and the system. We explain a client model that realizes personalized communication and the plan module that manages the structure of dialogue. In LOS, all kinds of information processing are done through everyday language. Language protocol is a computer protocol based on everyday language, and language-based application is a kind of agent software that provides services through language. We explain the characteristics of language protocol, the structure of language-based application programming interface, and text interpretation process of language-based applications. Finally, we discuss prospects of this project and mention future work that remains to be done. We argue that by processing meaning of language rather than processing numbers, we attempt to provide a more human-like computer system and an intelligent computational environment to all people. (shrink)

This paper presents a new multi-unit auction protocol that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying agent and Artificial Intelligence technologies. Although the Internet provides an excellent infrastructure for executing auctions, the possibility of a new type of cheating called false-name bids has been pointed out. A false-name bid is a bid submitted under a fictitious name. A protocol called LDS has been developed for combinatorial (...) auctions of multiple different items and has proven to be robust against false-name bids. Although we can modify the LDS protocol to handle multi-unit auctions, in which multiple units of an identical item are auctioned, the protocol is complicated and requires the auctioneer to carefully pre-determine the combination of bundles to obtain a high social surplus or revenue. For the auctioneer, our newly developed IR protocol is easier to use than the LDS, since the combination of bundles is automatically determined in a flexible manner according to the declared evaluation values of agents. The evaluation results show that the IR protocol can obtain a better social surplus than that obtained by the LDS protocol. (shrink)

An examination of the ways human movement can be represented as a formal language and how this language can be mediated technologically. In Motion and Representation, Nicolás Salazar Sutil considers the representation of human motion through languages of movement and technological mediation. He argues that technology transforms the representation of movement and that representation in turn transforms the way we move and what we understand to be movement. Humans communicate through movement, physically and mentally. To record and capture integrated movement (...) (both bodily and mental), by means of formal language and technological media, produces a material record and cultural expression of our evolving kinetic minds and identities. Salazar Sutil considers three forms of movement inscription: a written record (notation), a visual record (animation), and a computational record (motion capture). He focuses on what he calls kinetic formalism—formalized movement in such pursuits as dance, sports, live animation, and kinetic art, as well as abstract definitions of movement in mathematics and computer science. He explores the representation of kinetic space and spatiotemporality; the representation of mental plans of movement; movement notation, including stave notation (Labanotation) and such contemporary forms of notation as Choreographic Language Agent; and the impact of digital technology on contemporary representations of movement—in particular motion capture technology and Internet transfer protocols. Motion and Representation offers a unique cultural theory of movement and of the ever-changing ways of representing movement. (shrink)

Making good decisions in extremely complex and difficult processes and situations has always been both a key task as well as a challenge in the clinic and has led to a large amount of clinical, legal and ethical routines, protocols and reflections in order to guarantee fair, participatory and up-to-date pathways for clinical decision-making. Nevertheless, the complexity of processes and physical phenomena, time as well as economic constraints and not least further endeavours as well as achievements in medicine and (...) healthcare continuously raise the need to evaluate and to improve clinical decision-making. This article scrutinises if and how clinical decision-making processes are challenged by the rise of so-called artificial intelligence-driven decision support systems (AI-DSS). In a first step, this article analyses how the rise of AI-DSS will affect and transform the modes of interaction between different agents in the clinic. In a second step, we point out how these changing modes of interaction also imply shifts in the conditions of trustworthiness, epistemic challenges regarding transparency, the underlying normative concepts of agency and its embedding into concrete contexts of deployment and, finally, the consequences for (possible) ascriptions of responsibility. Third, we draw first conclusions for further steps regarding a ‘meaningful human control’ of clinical AI-DSS. (shrink)

Many logical systems today describe intelligent interacting agents over time. Frameworks include Interpreted Systems (IS, Fagin et al. [8]), Epistemic-Temporal Logic (ETL, Parikh & Ramanujam [22]), STIT (Belnap et al. [5]), Process Algebra and Game Semantics (Abramsky [1]). This variety is an asset, as different modeling tools can be fine-tuned to specific applications. But it may also be an obstacle, when barriers between paradigms and schools go up. This paper takes a closer look at one particular interface, between two systems (...) that both address the dynamics of knowledge and information flow in multi-agent systems. One is IS/ETL (IS and ETL are, from a technical point of view, the same up to model transformations, cf. [20]), which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. These models provide a Grand Stage where histories of some process unfold constrained by a protocol, and a matching epistemic-temporal language describes what happens. The other framework is Dynamic Epistemic Logic (DEL, [10, 4, 34]) that describes interactive processes in terms of epistemic event models which may occur inside modalities of the language. Temporal evolution is then computed from some initial epistemic model through a process of successive ‘product updates’. It has long been unclear how to best compare IS/ETL and DEL. Various aspects have been investigated in [10, 30, 32], but in this paper, we study the interface in a more systematic way. Often, DEL and ETL are presented as alternative ways of adding dynamics to multi-agent epistemic models. In this paper, we rather focus on how merging the two different modeling choices leads to interesting new questions. Our leading interest here will be a view of informational processes as evolving over time. To see what we mean, consider the simplest version of DEL, viz. the logic of public announcements PAL ([23]) which adds a very specific type of communicative 1 action to epistemic models: a public announcement.. (shrink)

A variety of logical frameworks have been developed to study rational agents interacting over time. This paper takes a closer look at one particular interface, between two systems that both address the dynamics of knowledge and information flow. The first is Epistemic Temporal Logic (ETL) which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event (...) models which may occur inside modalities of the language. This paper systematically and rigorously relates the DEL framework with the ETL framework. The precise relationship between DEL and ETL is explored via a new representation theorem characterizing the largest class of ETL models corresponding to DEL protocols in terms of notions of Perfect Recall , No Miracles , and Bisimulation Invariance . We then focus on new issues of completeness . One contribution is an axiomatization for the dynamic logic of public announcements constrained by protocols, which has been an open problem for some years, as it does not fit the usual ‘reduction axiom’ format of DEL. Finally, we provide a number of examples that show how DEL suggests an interesting fine-structure inside ETL. (shrink)

A variety of logical frameworks have been developed to study rational agents interacting over time. This paper takes a closer look at one particular interface, between two systems that both address the dynamics of knowledge and information flow. The first is Epistemic Temporal Logic (ETL) which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event (...) models which may occur inside modalities of the language. This paper systematically and rigorously relates the DEL framework with the ETL framework. The precise relationship between DEL and ETL is explored via a new representation theorem characterizing the largest class of ETL models corresponding to DEL protocols in terms of notions of Perfect Recall, No Miracles, and Bisimulation Invariance. We then focus on new issues of completeness. One contribution is an axiomatization for the dynamic logic of public announcements constrained by protocols, which has been an open problem for some years, as it does not fit the usual ‘reduction axiom’ format of DEL. Finally, we provide a number of examples that show how DEL suggests an interesting fine-structure inside ETL. (shrink)

In this paper we consider persuasion in the context of practical reasoning, and discuss the problems associated with construing reasoning about actions in a manner similar to reasoning about beliefs. We propose a perspective on practical reasoning as presumptive justification of a course of action, along with critical questions of this justification, building on the account of Walton. From this perspective, we articulate an interaction protocol, which we call PARMA, for dialogues over proposed actions based on this theory. We outline (...) an axiomatic semantics for the PARMA Protocol, and discuss two implementations which use this protocol to mediate a discussion between humans. We then show how our proposal can be made computational within the framework of agents based on the Belief-Desire-Intention model, and illustrate this proposal with an example debate within a multi agent system. (shrink)

Questions are triggers for explicit events of ‘issue management’. We give a complete logic in dynamic-epistemic style for events of raising, refining, and resolving an issue, all in the presence of information flow through observation or communication. We explore extensions of the framework to multi-agent scenarios and long-term temporal protocols. We sketch a comparison with some alternative accounts.