Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Y. D. Shen, Q. Yang, J. H. You, L. Y. Yuan

TL;DR
This paper presents a novel method to derive stationary dynamic Bayesian networks from logic programs with recursive loops, leveraging their inherent temporal structure without explicit time parameters.
Contribution
It introduces a new approach that uses recursive loops in logic programs to construct stationary dynamic Bayesian networks, overcoming previous limitations.
Findings
Successfully models stationary DBNs from recursive logic programs
Defines influence clauses for probabilistic dependencies
Provides algorithms for constructing two-slice DBNs from logic programs
Abstract
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they generate cyclic influences, which are disallowed in Bayesian networks. Therefore, in existing PLP approaches logic programs with recursive loops are considered to be problematic and thus are excluded. In this paper, we propose an approach that makes use of recursive loops to build a stationary dynamic Bayesian network. Our work stems from an observation that recursive loops in a logic program imply a time sequence and thus can be used to model a stationary dynamic Bayesian network without using explicit time parameters. We introduce a Bayesian knowledge base with logic clauses of the form , which naturally represents the knowledge…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Logic, Reasoning, and Knowledge · AI-based Problem Solving and Planning
