5243 search results - page 167 / 1049 » Reasoning About Strategies |
192
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
203
click to vote
ARGMAS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Several recent works in the area of Artificial Intelligence focus on computational models of argumentation-based negotiation. However, even if computational models of ar...
163
click to vote
LICS
2007
IEEE
16 years 24 days ago
2007
IEEE
We show how to construct the category of games and innocent strategies from a more primitive category of games. On that category we define a comonad and monad with the former dis...
193
click to vote
TPHOL
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
147
click to vote
ECLIPSE
2005
ACM
15 years 8 months ago
2005
ACM
Sharing mutable data (via aliasing) is a powerful programming technique. To facilitate sharing, object-oriented programming languages permit the programmer to selectively break en...