6355 search results - page 5 / 1271 » From Logic to Games |
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
We present systems of logic programming agents (LPAS) to model the interactions between decision-makers while evolving to a conclusion. Such a system consists of a number of agents...
FSTTCS
2008
Springer
13 years 12 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
ENTCS
2006
13 years 11 months ago
2006
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
CSL
2008
Springer
14 years 20 days ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
TARK
2007
Springer
14 years 5 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...