Playing with Trees and Logic

This document proposes an overview of my research sinc

Sequentiality vs. Concurrency in Games and Logic

Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.Comment: 35 pages, appeared in Mathematical Structures in Computer Scienc

Deciding the Borel complexity of regular tree languages

We show that it is decidable whether a given a regular tree language belongs to the class ${\bf \Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.Comment: 15 pages, 2 figure

When Poetry and Humor Get Hitched

Through humor, poetry explores the imagination and the mind just as it does through other means of expression. Comic poetry finds the truth in the illogical and in the absurd; it finds what unsettles us through its use of surprise; it finds delight and play in the unknown and uncertain. By its very nature, comic poetry clings to the edges of what we know, so pinpointing its characteristics is tricky. But the shared characteristic of all comic poetry is the permission the poet grants herself to disobey boundaries. The poet chooses not to fit her works within the reader’s expectations, the reader’s sense of logic, or the reader’s definitions of things in the world. Some of the boundaries crossed come out of breaking out of poetic custom. Many poems break boundaries of thought and expression; a comic poet uses one or more of these techniques to bring her funny poems to profound places. The result is always the exploration of unexplored or underexplored territory

Playing Smart - Artificial Intelligence in Computer Games

Abstract: With this document we will present an overview of artificial intelligence in general and artificial intelligence in the context of its use in modern computer games in particular. To this end we will firstly provide an introduction to the terminology of artificial intelligence, followed by a brief history of this field of computer science and finally we will discuss the impact which this science has had on the development of computer games. This will be further illustrated by a number of case studies, looking at how artificially intelligent behaviour has been achieved in selected games

Towards an Updatable Strategy Logic

This article is about temporal multi-agent logics. Several of these formalisms have been already presented (ATL-ATL*, ATLsc, SL). They enable to express the capacities of agents in a system to ensure the satisfaction of temporal properties. Particularly, SL and ATLsc enable several agents to interact in a context mixing the different strategies they play in a semantical game. We generalize this possibility by proposing a new formalism, Updating Strategy Logic (USL). In USL, an agent can also refine its own strategy. The gain in expressive power rises the notion of "sustainable capacities" for agents. USL is built from SL. It mainly brings to SL the two following modifications: semantically, the successor of a given state is not uniquely determined by the data of one choice from each agent. Syntactically, we introduce in the language an operator, called an "unbinder", which explicitely deletes the binding of a strategy to an agent. We show that USL is strictly more expressive than SL.Comment: In Proceedings SR 2013, arXiv:1303.007