295 search results - page 36 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
106
click to vote
WOLLIC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
AINA
2007
IEEE
15 years 4 months ago
2007
IEEE
In the Ad-Hoc InfoWare project, we develop a delay tolerant event notification service for sparse Mobile Ad-Hoc Networks for emergency and rescue operations. In most event notific...
APLAS
2004
ACM
15 years 1 months ago
2004
ACM
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The ...
APN
2008
Springer
14 years 11 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
106
click to vote
KR
2010
Springer
15 years 2 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...