In the classical framework of graph algorithms, program logics, and corresponding model checking games, one considers changes of system states and movements of agents within a system, but the underlying graph or structure is assumed to be static. This limitation motivates a more general approach where dynamic changes of structures are relevant. In this thesis, we take up a proposal of van Benth...

Modal Logic is traditionally concerned with the intensional operators “possibly” and “necessary”, whose intuitive correspondence with the standard quantifiers “there exists” and “for all” comes out clearly in the usual Kripke semantics. This observation underlies the well-known translation from propositional modal logic with operators ♦ and , possibly indexed, into the first-order language over...

In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoreti...

In this paper object-oriented methods are examined, problems are pointed out and a new method is presented. In object-oriented analysis and design methods two types of models can be identified. On one hand, static architecture models are quite similar in all methods and can be considered as very elaborate. For dynamic models, on the other hand, a number of problems are encountered. They are not...

Dynamic epistemic logic, broadly conceived, is the study of logics of information change. In this first paper, I introduce the basic logical systems for reasoning about the knowledge and beliefs of a group of agents.

A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper we formally define sliding-window dynamic frameproof codes and provide optimal constructions for a certain class of these schemes. We also discuss bounds on the number of users such schemes

We study a dynamic matching environment where individuals arrive sequentially. There is a tradeoff between waiting for a thicker market, allowing for higher quality matches, and minimizing agents’waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and matches all others in an assortative fashion instantaneously. In decentralized settings, a similar prot...

One way to allocate tasks to agents is by ascribing them obligations. From obligations to be, agents are able to infer what are the forbidden, permitted and obligatory actions they may perform, by using the wellknown Meyer’s reduction from obligations to be to obligations to do. However, we show through an example that this method is not completely adequate to guide agents’ decisions. We then p...

It has been proposed that a good way of allocating tasks to agents is by ascribing them obligations, i.e., if we want agent i achieves φ, we can stipulate that ‘it is obligatory for i that φ’. Here, we argue that this method is not adequate to guide agent’s decisions. Then, using a multi-agent extension of propositional dynamic logic, with operators expressing agents’ knowledge and abilities, w...

In our research, we have developed an architecture and computational structure that allows for a generic team of robots to dynamically discern what their capabilities are and then apply those to evaluate if the team can achieve an externally mandated set of goals. We define the process of dynamic capability evaluation to determine if a team of robots can build a cooperative organization with th...