The total order assumption (TOA) is the assumption that all execution sequences of observable actions or events are totally ordered by precedence. As long as in some cases TOA is to the point, total order and partial order semantics are both legitimate but lead to different theories. I argue that TOA is a simplifying assumption, and present an example of a total order theory without interleavin...

It has been a remarkable text, Wilfred Bion's Experiences in Groups (1961); a landmark in thought and conceptualization of the unconscious functioning of human beings in groups. The working hypotheses he formulated on the mental activity of members of groups have robustly stood the test of time. In part, this has been because of the Working Conferences on Group Relations which started from his ...

In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of the Dempster-Shafer theory of evidence. Laskey, Lehner [1] and Provan [2] have already proposed a similar point of view but these papers do not emphasize the mathematical foundations of the probabilistic assumptionbas...

......................................................................................... II CHAPTER 1 – INTRODUCING THE STUDY ............................................. 1 THE PERSONAL CONTEXT ........................................................................... 2 THE PROFESSIONAL CONTEXT ...................................................................... 5 THE REGISTERED PHARMACIST...

Foundations for iterated admissibility (i.e., the iterated removal of weakly dominated strategies) need to confront a fundamental challenge. On the one hand, admissibility requires that a player consider every strategy of their opponents possible. On the other hand, reasoning that the opponents are rational requires ruling out certain strategies. Brandenburger, Friedenberg and Keisler’s (BFK, E...

In the study of distributed systems, the assumption-commitment framework is crucial for compositional speciication of processes. The idea is that we reason about each process separately, making suitable assumptions about other processes in the system. Symmetrically, each process commits to certain actions which the other processes can rely on. We study such a framework from an automata-theoreti...

Recently, argument labellings have been proposed as a new (equivalent) way to express the extension semantics of Abstract Argumentation (AA) frameworks. Here, we introduce a labelling approach for the complete semantics in Assumption-Based Argumentation (ABA), where labels are assigned to assumptions rather than whole arguments. We prove that the complete assumption labelling corresponds to the...

This chapter is concerned with the impact of traffic correlations on the end-to-end delay of packets in a chain of IP routers represented by an open tandem queueing system. Particular consideration is given to Kleinrock’s independence assumption on the performance impact of traffic correlation on packet switched networks with Poisson arrival processes and exponential packet length distributions...

Hash Tables A hash table is a data structure with the following operations: • INSERT(k, v): insert an item with key k and value v • SEARCH(k): searches the hash table for key k • DELETE(k): deletes key k from the hash table Goal is to have each of these operations in O(1) time. You can think of a hash table as a list of m slots. Inserting a key puts it in one of the slots in the hash table, del...

Formal argumentation based dialogue models have attracted some research interests recently. Within this line of research, we propose a formal model for argumentation-based dialogues between agents, using assumption-based argumentation (ABA). Thus, the dialogues amount to conducting an argumentation process in ABA. The model is given in terms of ABA-specific utterances, debate trees and forests ...