Sciweavers

1300 search results - page 49 / 260
» Probabilistic logic with independence
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 10 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
IGPL
2002
91views more  IGPL 2002»
13 years 8 months ago
The Unrestricted Combination of Temporal Logic Systems
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
Marcelo Finger, M. Angela Weiss
LICS
2003
IEEE
14 years 1 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ATAL
2006
Springer
14 years 13 days ago
A stochastic language for modelling opponent agents
There are numerous cases where a reasoning agent needs to reason about the behavior of an opponent agent. In this paper, we propose a hybrid probabilistic logic language within wh...
Gerardo I. Simari, Amy Sliva, Dana S. Nau, V. S. S...