Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +

DOI10.1017/S1471068420000472OpenAlexW4245877774MaRDI QIDQ4957223

Joohyung Lee, Yi Wang

Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.00512

zbMATH Keywords

Markov decision processanswer set programmingaction language

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Smodels
• FODD-Planner
• CCalc
• REBA
• PEORL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A synthesis of automated planning and reinforcement learning for efficient, robust decision-making
• Nonmonotonic causal theories
• Practical solution techniques for first-order MDPs
• Elaboration tolerant representation of Markov decision process via decision-theoretic extension of probabilistic action language \(p\mathcal{BC}+\)
• Well-founded and stable semantics of logic programs with aggregates
• Online Action Language $$o\mathcal {BC}$$+
• Probabilistic reasoning with answer sets
• Representing action and change by logic programs
• A Probabilistic Extension of Action Language
• Computing LP^MLN using ASP and MLN solvers
• REBA: A Refinement-Based Architecture for Knowledge Representation and Reasoning in Robotics
• Logic Programming
• Logics in Artificial Intelligence
• The Independent Choice Logic and Beyond
• Logic Programming and Nonmonotonic Reasoning

This page was built for publication: Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +