Sciweavers

123 search results - page 10 / 25
» Program verification as probabilistic inference
Sort
View
CP
2006
Springer
13 years 11 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
UAI
1997
13 years 9 months ago
Object-Oriented Bayesian Networks
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
Daphne Koller, Avi Pfeffer
AUSAI
2004
Springer
14 years 1 months ago
MML Inference of Oblique Decision Trees
We propose a multivariate decision tree inference scheme by using the minimum message length (MML) principle (Wallace and Boulton, 1968; Wallace and Dowe, 1999). The scheme uses MM...
Peter J. Tan, David L. Dowe
FLAIRS
2009
13 years 5 months ago
Constraint-based Approach to Discovery of Inter Module Dependencies in Modular Bayesian Networks
This paper introduces an information theoretic approach to verification of modular causal probabilistic models. We assume systems which are gradually extended by adding new functi...
Patrick de Oude, Gregor Pavlin
SIGSOFT
2002
ACM
14 years 8 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst