4217 search results - page 11 / 844 » Computational indistinguishability logic |
KR
1991
Springer
14 years 1 months ago
1991
Springer
In the paper, we investigate the way in which nonmonotonic modal logics depend on their underlying monotonic modal logics. Most notably, we study when different monotonic modal l...
EUROCRYPT
2008
Springer
13 years 11 months ago
2008
Springer
We study obfuscation of point functions with multibit output and other related functions. A point function with multibit output returns a string on a single input point and zero ev...
RULEML
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the a...
TACAS
2007
Springer
14 years 3 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
AIL
2008
13 years 10 months ago
2008
This paper provides a computational framework, based on Defeasible Logic, to capture some aspects of institutional agency. Our background is Kanger-Lindahl-P