Sciweavers

390 search results - page 31 / 78
» Probability Logic and Logical Probability
Sort
View
TPHOL
2009
IEEE
15 years 10 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
113
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
Objective Bayesian Nets
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...
Jon Williamson
116
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
Reliability in Layered Networks with Random Link Failures
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
Kayi Lee, Hyang-Won Lee, Eytan Modiano
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 4 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty
114
Voted
FOSSACS
2007
Springer
15 years 9 months ago
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Augusto Parma, Roberto Segala