Sciweavers

295 search results - page 12 / 59
» Approximating the Expressive Power of Logics in Finite Model...
Sort
View
SP
1997
IEEE
134views Security Privacy» more  SP 1997»
15 years 1 months ago
A Logical Language for Expressing Authorizations
A major drawback of existing access control systems is that they have all been developed with a specific access control policy in mind. This means that all protection requirement...
Sushil Jajodia, Pierangela Samarati, V. S. Subrahm...
TABLEAUX
1999
Springer
15 years 1 months ago
Tableau Calculi for Hybrid Logics
Hybrid logics were proposed in 15 as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as...
Miroslava Tzakova
TNN
2010
216views Management» more  TNN 2010»
14 years 4 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
CORR
2006
Springer
121views Education» more  CORR 2006»
14 years 9 months ago
Loop series for discrete statistical models on graphs
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...
Michael Chertkov, Vladimir Y. Chernyak
CONCUR
2006
Springer
14 years 11 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink