Infinite probability computation by cyclic explanation graphs
From MaRDI portal
Publication:2933089
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
tablingprefixprobabilistic logic programsprobability computationprobabilistic context-free grammarsprobability equation
Grammars and rewriting systems (68Q42) Logic programming (68N17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings
- Probabilistic inductive logic programming. Theory and applications
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- On applying or-parallelism and tabling to logic programs
- Model checking with probabilistic tabled logic programming
- Linear tabling strategies and optimizations