5084 search results - page 32 / 1017 » Proving Possibility Properties |
CAAN
2004
Springer
14 years 3 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
AIML
2008
13 years 11 months ago
2008
We provide proof-theoretic results about deliberative STIT logic. First we present STIT logic for individual agents without time, where the problem of satisfiability has recently b...
PODS
2008
ACM
14 years 10 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
CIE
2008
Springer
13 years 12 months ago
2008
Springer
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...