498 search results - page 70 / 100 » A Formal Foundation for ODRL |
138
click to vote
STOC
1993
ACM
15 years 2 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
122
click to vote
SAS
1992
Springer
15 years 1 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
CCS
2008
ACM
14 years 12 months ago
2008
ACM
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
JANCL
2008
14 years 10 months ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
AI
2004
Springer
14 years 9 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...