Cargando…
Logic + probabilistic programming + causal laws
Probabilistic planning attempts to incorporate stochastic models directly into the planning process, which is the problem of synthesizing a sequence of actions that achieves some objective for a putative agent. Probabilistic programming has rapidly emerged as a key paradigm to integrate probabilisti...
Autor principal: | |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
The Royal Society
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10523076/ https://www.ncbi.nlm.nih.gov/pubmed/37771971 http://dx.doi.org/10.1098/rsos.230785 |
_version_ | 1785110489966051328 |
---|---|
author | Belle, Vaishak |
author_facet | Belle, Vaishak |
author_sort | Belle, Vaishak |
collection | PubMed |
description | Probabilistic planning attempts to incorporate stochastic models directly into the planning process, which is the problem of synthesizing a sequence of actions that achieves some objective for a putative agent. Probabilistic programming has rapidly emerged as a key paradigm to integrate probabilistic concepts with programming languages, which allows one to specify complex probabilistic models using programming primitives like recursion and loops. Probabilistic logic programming aims to further ease the specification of structured probability distributions using first-order logical artefacts. In this article, we briefly discuss the modelling of probabilistic planning through the lens of probabilistic (logic) programming. Although many flavours for such an integration are possible, we focus on two representative examples. The first is an extension to the popular probabilistic logic programming language PROBLOG, which permits the decoration of probabilities on Horn clauses—that is, prolog programs. The second is an extension to the popular agent programming language GOLOG, which permits the logical specification of dynamical systems via actions, effects and observations. The probabilistic extensions thereof emphasize different strengths of probabilistic programming that are particularly useful for non-trivial modelling issues raised in probabilistic planning. Among other things, one can instantiate planning problems with growing and shrinking state spaces, discrete and continuous probability distributions, and non-unique prior distributions in a first-order setting. |
format | Online Article Text |
id | pubmed-10523076 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | The Royal Society |
record_format | MEDLINE/PubMed |
spelling | pubmed-105230762023-09-28 Logic + probabilistic programming + causal laws Belle, Vaishak R Soc Open Sci Computer Science and Artificial Intelligence Probabilistic planning attempts to incorporate stochastic models directly into the planning process, which is the problem of synthesizing a sequence of actions that achieves some objective for a putative agent. Probabilistic programming has rapidly emerged as a key paradigm to integrate probabilistic concepts with programming languages, which allows one to specify complex probabilistic models using programming primitives like recursion and loops. Probabilistic logic programming aims to further ease the specification of structured probability distributions using first-order logical artefacts. In this article, we briefly discuss the modelling of probabilistic planning through the lens of probabilistic (logic) programming. Although many flavours for such an integration are possible, we focus on two representative examples. The first is an extension to the popular probabilistic logic programming language PROBLOG, which permits the decoration of probabilities on Horn clauses—that is, prolog programs. The second is an extension to the popular agent programming language GOLOG, which permits the logical specification of dynamical systems via actions, effects and observations. The probabilistic extensions thereof emphasize different strengths of probabilistic programming that are particularly useful for non-trivial modelling issues raised in probabilistic planning. Among other things, one can instantiate planning problems with growing and shrinking state spaces, discrete and continuous probability distributions, and non-unique prior distributions in a first-order setting. The Royal Society 2023-09-27 /pmc/articles/PMC10523076/ /pubmed/37771971 http://dx.doi.org/10.1098/rsos.230785 Text en © 2023 The Authors. https://creativecommons.org/licenses/by/4.0/Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, provided the original author and source are credited. |
spellingShingle | Computer Science and Artificial Intelligence Belle, Vaishak Logic + probabilistic programming + causal laws |
title | Logic + probabilistic programming + causal laws |
title_full | Logic + probabilistic programming + causal laws |
title_fullStr | Logic + probabilistic programming + causal laws |
title_full_unstemmed | Logic + probabilistic programming + causal laws |
title_short | Logic + probabilistic programming + causal laws |
title_sort | logic + probabilistic programming + causal laws |
topic | Computer Science and Artificial Intelligence |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10523076/ https://www.ncbi.nlm.nih.gov/pubmed/37771971 http://dx.doi.org/10.1098/rsos.230785 |
work_keys_str_mv | AT bellevaishak logicprobabilisticprogrammingcausallaws |