1699 search results - page 297 / 340 » On the Expressive Power of QLTL |
142
click to vote
KR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
126
click to vote
ECOOPW
1999
Springer
15 years 6 months ago
1999
Springer
Existing authorization mechanisms fail to provide powerful and robust tools for handling security at the scale necessary for today's Internet. These mechanisms are coming unde...
134
click to vote
AISC
1998
Springer
15 years 6 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
103
click to vote
TIC
1998
Springer
15 years 6 months ago
1998
Springer
In previous work, we presented a Typed Assembly Language (TAL). TAL is sufficiently expressive to serve as a target language for compilers of high-level languages such as ML. More...
151
click to vote
MCMASTER
1993
15 years 6 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...