6355 search results - page 5 / 1271 » From Logic to Games |
134
click to vote
AMAI
2004
Springer
15 years 1 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...
130
click to vote
FSTTCS
2008
Springer
15 years 2 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...
145
Voted
ENTCS
2006
15 years 1 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...
115
click to vote
CSL
2008
Springer
15 years 3 months 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...
142
Voted
TARK
2007
Springer
15 years 8 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...