2501 search results - page 208 / 501 » Logics with Rank Operators |
175
click to vote
CCS
2005
ACM
15 years 10 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
133
click to vote
CTCS
1989
Springer
15 years 9 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
167
click to vote
PLANX
2007
15 years 6 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
175
click to vote
OPODIS
2003
15 years 6 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
138
click to vote
DLOG
1996
15 years 6 months ago
1996
In 1995, I nished my Ph.D. project which was focused on the selection of adequate Knowledge-Representation Systems (KRSs) for research applications. When I started working at the ...