98 search results - page 8 / 20 » Conditional Independence Relations in Possibility Theory |
102
click to vote
AIML
2004
15 years 1 months ago
2004
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame s...
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
110
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
107
click to vote
INFORMATICALT
2010
14 years 9 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
106
click to vote
EUSFLAT
2007
15 years 1 months ago
2007
In this work we propose a general approach for representing uncertainty measures in the framework of t-norm based logics. This approach is extended also to classes of measures lik...