1653 search results - page 196 / 331 » Computer science and game theory |
TLCA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
76
Voted
RANDOM
1997
Springer
15 years 3 months ago
1997
Springer
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
102
click to vote
ACM
1995
15 years 2 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
89
Voted
TCS
2010
14 years 9 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
91
Voted
ATAL
2008
Springer
15 years 26 days ago
2008
Springer
Computer agents participate in many collaborative and competitive multiagent domains in which humans make decisions. For computer agents to interact successfully with people in su...