39 search results - page 4 / 8 » A Direct Semantic Characterization of RELFUN |
SACMAT
2009
ACM
15 years 4 months ago
2009
ACM
We develop the foundations for a theory of Group-Centric Secure Information Sharing (g-SIS), characterize a specific family of models in this arena and identify several direction...
COLCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
The Data Interoperability Problem appears in contexts where consumers need to peruse data owned by producers, and the syntax and/or semantics of such data—at both end points—ar...
AMAST
2006
Springer
15 years 1 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
106
click to vote
AIML
2008
14 years 11 months ago
2008
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...