DeepAI AI Chat
Log In Sign Up

A Probabilistic Network of Predicates

by   Dekang Lin, et al.

Bayesian networks are directed acyclic graphs representing independence relationships among a set of random variables. A random variable can be regarded as a set of exhaustive and mutually exclusive propositions. We argue that there are several drawbacks resulting from the propositional nature and acyclic structure of Bayesian networks. To remedy these shortcomings, we propose a probabilistic network where nodes represent unary predicates and which may contain directed cycles. The proposed representation allows us to represent domain knowledge in a single static network even though we cannot determine the instantiations of the predicates before hand. The ability to deal with cycles also enables us to handle cyclic causal tendencies and to recognize recursive plans.


page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8


On the Foundations of Cycles in Bayesian Networks

Bayesian networks (BNs) are a probabilistic graphical model widely used ...

Bayesian Networks for Named Entity Prediction in Programming Community Question Answering

Within this study, we propose a new approach for natural language proces...

NOTMAD: Estimating Bayesian Networks with Sample-Specific Structures and Parameters

Context-specific Bayesian networks (i.e. directed acyclic graphs, DAGs) ...

An Improved Admissible Heuristic for Learning Optimal Bayesian Networks

Recently two search algorithms, A* and breadth-first branch and bound (B...

Beyond DAGs: Modeling Causal Feedback with Fuzzy Cognitive Maps

Fuzzy cognitive maps (FCMs) model feedback causal relations in interwove...

Generating Bayesian Network Models from Data Using Tsetlin Machines

Bayesian networks (BN) are directed acyclic graphical (DAG) models that ...

The Probabilistic Backbone of Data-Driven Complex Networks: An example in Climate

Correlation Networks (CNs) inherently suffer from redundant information ...