Reasoning with recursive loops under the PLP framework


Recursive loops in a logic program present a challenging problem to the PLP (Probabilistic Logic Programming) framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they may generate cyclic influences, which are disallowed in Bayesian networks. Therefore, in existing PLP approaches… (More)
DOI: 10.1145/1380572.1380576


6 Figures and Tables