295 search results - page 33 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
An information-theoretic analysis of a multi-keyhole channel, which includes a number of statistically independent keyholes with possibly different correlation matrices, is given. ...
183
click to vote
ACMICEC
2005
ACM
15 years 11 months ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
158
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
152
click to vote
DSN
2004
IEEE
15 years 9 months ago
2004
IEEE
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
154
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...