Evidential support logic programming
Fuzzy Sets and Systems
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Essentials of logic programming
Essentials of logic programming
Probabilistic logic programming
Information and Computation
Probabilistic Horn abduction and Bayesian networks
Artificial Intelligence
Efficient EM Learning with Tabulation for Parameterized Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
Journal of Artificial Intelligence Research
Stochastic logic programs: sampling, inference and applications
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Hybrid processing of beliefs and constraints
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Probabilistic logic programming under inheritance with overriding
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Uncertain inferences and uncertain conclusions
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
CLP(BN): constraint logic programming for probabilistic knowledge
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
| Hi-index | 0.00 |
We present a language for integrating probabilistic reasoning and logic programming. The key idea is to use constraints based techniques such as the constraints store and finite domain variables. First we show how these techniques can be used to integrate a number of probabilistic inference algorithms with logic programming. We then proceed to detail a language which effects conditioning by probabilistically partitioning the constraint store. We elucidate the kinds of reasoning effected by the introduced language by means of two well known probabilistic problems: the three prisoners and Monty Hall. In particular we show how the syntax of the language can be used to avoid the pitfalls normally associated with the two problems. An elimination algorithm for computing the probability of a query in a given store is presented.