Probabilistic inference in SWI-Prolog
Probabilistic Logic Programming (PLP) emerged as one of the most prominent approaches to cope with real-world domains. The distribution semantics is one of most used in PLP, as it is followed by many languages, such as Independent Choice Logic, PRISM, pD, Logic Programs with Annotated Disjunctions (LPADs) and ProbLog. A possible system that allows performing inference on LPADs is PITA, which transforms the input LPAD into a Prolog program containing calls to library predicates for handling Binary Decision Diagrams (BDDs). In particular, BDDs are used to compactly encode explanations for goals and efficiently compute their probability. However, PITA needs mode-directed tabling (also called tabling with answer subsumption), which has been implemented in SWI-Prolog only recently. This paper shows how SWI-Prolog has been extended to include correct answer subsumption and how the PITA transformation has been changed to use SWI-Prolog implementation.
|Answer subsumption, Logic programs with annotated disjunctions, Probabilistic logic programming, Answer subsumption, Tabling|
|International Workshop on Probabilistic Logic Programming, PLP 2018|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Riguzzi, F, Wielemaker, J, & Zese, R. (2018). Probabilistic inference in SWI-Prolog. In CEUR Workshop Proceedings (pp. 15–27).