Planning in hybrid relational MDPs

DOI10.1007/s10994-017-5669-xzbMath1457.68254OpenAlexW2754595813MaRDI QIDQ1699911

Vaishak Belle, Tinne De Laet, Davide Nitti, Luc De Raedt

Publication date: 26 February 2018

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-017-5669-x

zbMATH Keywords

importance samplinglogic programmingabstractionprobabilistic programminghybridprobabilistic planninghybrid relational MDPlogical regressionrelational MDP

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (4)

Probabilistic logic programming for hybrid relational domains ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Learning Distributional Programs for Relational Autocompletion ⋮ Planning in hybrid relational MDPs

Uses Software

• ProbLog
• FODD-Planner
• FluCaP
• Church
• PREGO
• BLOG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence notions and model minimization in Markov decision processes
• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• Planning in hybrid relational MDPs
• Probabilistic logic programming for hybrid relational domains
• Planning with Markov Decision Processes: An AI Perspective
• On the implementation of the probabilistic logic programming language ProbLog
• Planning with Noisy Probabilistic Relational Rules
• The magic of logical inference in probabilistic programming
• Sample-Based Tree Search with Fixed and Adaptive State Abstractions
• From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
• On the Efficient Execution of ProbLog Programs
• Relational reinforcement learning

This page was built for publication: Planning in hybrid relational MDPs