Infinite probability computation by cyclic explanation graphs

DOI10.1017/S1471068413000562zbMath1302.68054arXiv1309.0339MaRDI QIDQ2933089

No author found.

Publication date: 10 December 2014

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.0339

zbMATH Keywords

tabling; prefix; probabilistic logic programs; probability computation; probabilistic context-free grammars; probability equation

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

68N17: Logic programming

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Uses Software

• PRISM
• XSB
• OPTYap