52 search results - page 9 / 11 » Propositional Games with Explicit Strategies |
ECCC
2010
13 years 6 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
FOSSACS
2003
Springer
14 years 21 days ago
2003
Springer
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
ISIPTA
2005
IEEE
14 years 1 months ago
2005
IEEE
: A generalization of subjective expected utility is presented in which the primitives are a finite set of states of the world, a finite set of strategies available to the decision...
IJFCS
2008
13 years 7 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...