Probabilistic logic programming for hybrid relational domains
From MaRDI portal
Publication:2630824
DOI10.1007/s10994-016-5558-8zbMath1362.68247OpenAlexW2341971562MaRDI QIDQ2630824
Luc De Raedt, Davide Nitti, Tinne De Laet
Publication date: 22 July 2016
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5558-8
logic programmingparticle filterprobabilistic programmingstatistical relational learningdiscrete and continuous distributionslikelihood weighting
Related Items
\(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Constraint-Based Inference in Probabilistic Logic Programs ⋮ Learning Distributional Programs for Relational Autocompletion ⋮ Planning in hybrid relational MDPs ⋮ Lifted Bayesian Filtering in Multiset Rewriting Systems ⋮ A semantics for hybrid probabilistic logic programs with function symbols
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic relational processes: efficient inference and applications
- First-order logical filtering
- Particle learning and smoothing
- Planning in hybrid relational MDPs
- A particle filtering approach for tracking an unknown number of objects with dynamic relations
- Probabilistic inductive logic programming. Theory and applications
- Monte Carlo and quasi-Monte Carlo sampling
- Particle learning for general mixtures
- Following a Moving Target—Monte Carlo Inference for Dynamic Bayesian Models
- The magic of logical inference in probabilistic programming
- Rao-Blackwellisation of sampling schemes
- Partial evaluation in logic programming
- Filtering via Simulation: Auxiliary Particle Filters
- On the Efficient Execution of ProbLog Programs