Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2023 Sep 27;10(9):230785.
doi: 10.1098/rsos.230785. eCollection 2023 Sep.

Logic + probabilistic programming + causal laws

Affiliations

Logic + probabilistic programming + causal laws

Vaishak Belle. R Soc Open Sci. .

Abstract

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.

Keywords: first-order logic; probabilistic programming; statistical relational learning.

PubMed Disclaimer

Conflict of interest statement

I declare I have no competing interests.

References

    1. Fikes R, Nilsson NJ. 1971. STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2, 189-208. (10.1016/0004-3702(71)90010-5) - DOI
    1. Thrun S, Burgard W, Fox D. 2005. Probabilistic robotics. New York, NY: MIT Press.
    1. Boutilier C, Dean T, Hanks S. 1999. Decision-theoretic planning: structural assumptions and computational leverage. J. Artif. Intell. Res. 11, 94. (10.1613/jair.575) - DOI
    1. Domshlak C, Hoffmann J. 2007. Probabilistic planning via heuristic forward search and weighted model counting. J. Artif. Intell. Res. 30, 565-620. (10.1613/jair.2289) - DOI
    1. Kaelbling LP, Littman ML, Cassandra AR. 1998. Planning and acting in partially observable stochastic domains. Artif. Intell. 101, 99-134. (10.1016/S0004-3702(98)00023-X) - DOI