5084 search results - page 213 / 1017 » Proving Possibility Properties |
175
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
167
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
171
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a general revision model on epistemic states based on plausibility measures proposed by Friedman and Halpern. We propose our revision strategy and give so...
167
click to vote
DBSEC
2007
15 years 7 months ago
2007
Abstract. Despite the widespread adoption of Role-based Access Control (RBAC) models, new access control models are required for new applications for which RBAC may not be especial...
146
click to vote
ECIR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...