Sciweavers

565 search results - page 59 / 113
» A logic for authorization provenance
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 9 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
COLING
2006
13 years 8 months ago
Geometry and Meaning
and logic defined on certain types of abstract spaces and how that intimate relationship might be exploited when applied in computational linguistics. It is also about an approach ...
C. J. van Rijsbergen
JCS
2006
118views more  JCS 2006»
13 years 8 months ago
Language based policy analysis in a SPKI Trust Management System
Abstract-- SPKI/SDSI is a standard for issuing authorization and name certificates. SPKI/SDSI can be used to implement a Trust Management System, where the policy for resource acce...
Arun K. Eamani, A. Prasad Sistla
APAL
2005
82views more  APAL 2005»
13 years 8 months ago
A descending chain condition for groups definable in o-minimal structures
We prove that if G is a group definable in a saturated o-minimal structure, then G has no infinite descending chain of type-definable subgroups of bounded index. Equivalently, G h...
Alessandro Berarducci, Margarita Otero, Ya'acov Pe...
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 8 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm