366 search results - page 34 / 74 » Reasoning about relational granulation in modal logics |
104
click to vote
TLDI
2009
ACM
15 years 8 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
ARTS
1999
Springer
15 years 4 months ago
1999
Springer
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
102
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
JOLLI
2006
14 years 11 months ago
2006
Abstract. Propositional dynamic logic (PDL) provides a natural setting for semantics of means-end relations involving non-determinism, but such models do not include probabilistic ...
109
click to vote
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we combine existing work in the area of social laws with a framework for reasoning about knowledge in multi-agent systems. The unifying framework in which this is do...