Infinite probability computation by cyclic explanation graphs

DOI10.1017/S1471068413000562MaRDI QIDQ2933089zbMATH OpenFDO

Authors

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

prefixprobabilistic context-free grammarsprobabilistic logic programsprobability computationprobability equationtabling

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Abstract: Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we investigate another possibility of tabling, i.e. to compute an infinite sum of probabilities for probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for probabilistic context free grammars (PCFGs) to probabilistic logic programs. Given a top-goal, we search for all proofs with tabling and obtain an explanation graph which compresses them and may be cyclic. We then convert the explanation graph to a set of linear probability equations and solve them by matrix operation. The solution gives us the probability of the top-goal, which, in nature, is an infinite sum of probabilities. Our general approach to prefix probability computation through tabling not only allows to deal with non-PCFGs such as probabilistic left-corner grammars (PLCGs) but has applications such as plan recognition and probabilistic model checking and makes it possible to compute probability for probabilistic models describing cyclic relations. To appear in Theory and Practice of Logic Programming (TPLP).

Recommendations

• Tabling for infinite probability computation
• Dedicated tabling for a probabilistic setting
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• Model checking with probabilistic tabled logic programming
• The PITA system: tabling and answer subsumption for reasoning under uncertainty

Cites work

• Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings
• scientific article; zbMATH DE number 1408945 (Why is no real title available?)
• Linear tabling strategies and optimizations
• Model checking with probabilistic tabled logic programming
• On applying or-parallelism and tabling to logic programs
• Probabilistic inductive logic programming. Theory and applications
• The PITA system: tabling and answer subsumption for reasoning under uncertainty

Cited in

(4)

• Learning to rank in PRISM
• Dedicated tabling for a probabilistic setting
• The distribution semantics for normal programs with function symbols
• Tabling for infinite probability computation

Describes a project that uses

Uses Software

• PRISM
• XSB
• OPTYap

This page was built for publication: Infinite probability computation by cyclic explanation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933089)