201 search results - page 6 / 41 » An Authorization Logic With Explicit Time |
ICFP
2000
ACM
14 years 3 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
SACMAT
2003
ACM
14 years 4 months ago
2003
ACM
In large organizations the administration of access privileges (such as the assignment of an access right to a user in a particular role) is handled cooperatively through distribu...
AIML
2008
14 years 6 days ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
FROCOS
2007
Springer
14 years 5 months ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
AAAI
2008
14 years 1 months ago
2008
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...