Constraint-Based Inference in Probabilistic Logic Programs
From MaRDI portal
Publication:4559821
DOI10.1017/S1471068418000273zbMath1451.68264arXiv1804.10237WikidataQ129410083 ScholiaQ129410083MaRDI QIDQ4559821
Timothy Zhang, Arun Nampally, C. R. Ramakrishnan
Publication date: 4 December 2018
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.10237
Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Related Items (4)
Parallelizing MCMC sampling via space partitioning ⋮ Unnamed Item ⋮ Causal inference in cplint ⋮ Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism
Uses Software
Cites Work
- Probabilistic logic programming for hybrid relational domains
- Lifted Variable Elimination for Probabilistic Logic Programming
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Monte Carlo sampling methods using Markov chains and their applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constraint-Based Inference in Probabilistic Logic Programs