394 search results - page 33 / 79 » Logical operations and Kolmogorov complexity |
134
click to vote
WOLLIC
2010
Springer
15 years 6 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 ...
224
click to vote
POPL
2006
ACM
16 years 1 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
138
click to vote
CLIMA
2004
15 years 2 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
107
click to vote
CSL
2004
Springer
15 years 6 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
133
click to vote
TCAD
2008
15 years 1 months ago
2008
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...