Model-checking the alternating-time temporal logics AT L and AT L * with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper we consider two other types of semantics based on finite-memory strategies. One where the memory size allowed is bounded and one where the memory size is unbounded (but must be finite). This is motivated by the high complexity of model-checking with perfect recall semantics and the severe limitations of memoryless strategies. We show that both types of semantics introduced are different from perfect recall and memoryless semantics and next focus on the decidability and complexity of model-checking in both complete and incomplete information games for AT L/AT L * . In particular, we show that the complexity of model-checking with bounded-memory semantics is ∆ p 2 -complete for AT L and PSPACE-complete for AT L * in incomplete information games just as in the memoryless case. We also present a proof that AT L and AT L * model-checking is undecidable for n ≥ 3 players with finite-memory semantics in incomplete information games.

We describe the approach used to develop the multi-agent system of herders that competed as the Jason-DTU team at the Multi-Agent Programming Contest 2010. We also participated in 2009 with a system developed in the agentoriented programming language Jason which is an extension of AgentSpeak. We used the implementation from 2009 as a foundation and therefore much of the work done this year was on improving that implementation. We present a description which includes design and analysis of the system as well as the main features of our agent team strategy. In addition we discuss the technologies used to develop this system as well as our future goals in the area.

International audienc

No abstract

Abstract. We study the complexity of the model-checking problem for the branching-time logic CTL * and the alternating-time temporal logics ATL/ATL * in one-counter processes and one-counter games respectively. The complexity is determined for all three logics when integer weights are input in unary (non-succinct) and binary (succinct) as well as when the input formula is fixed and is a parameter. Further, we show that deciding the winner in one-counter games with LTL objectives is 2ExpSpace-complete for both succinct and non-succinct games. We show that all the problems considered stay in the same complexity classes when we add quantitative constraints that can compare the current value of the counter with a constant.