126 search results - page 4 / 26 » A Logic for Reasoning About Game Strategies |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We present the logic CTL.STIT, which is the join of the logic CTL with a multi-agent strategic stit-logic variant. CTL.STIT subsumes ATL, and adds expressivity to it that we claim...
MST
2011
13 years 3 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
AAAI
2006
13 years 10 months ago
2006
Partially observed actions are observations of action executions in which we are uncertain about the identity of objects, agents, or locations involved in the actions (e.g., we kn...
ATAL
2006
Springer
14 years 10 days ago
2006
Springer
We develop a logic for representing and reasoning about coalitional games without transferable payoffs. Although a number of logics of cooperation have been proposed over the past...
APWEB
2006
Springer
14 years 10 days ago
2006
Springer
Named Graphs is a simple, compatible extension to the RDF syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF r...