Infinite probability computation by cyclic explanation graphs (Q2933089): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Linear tabling strategies and optimizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4939994 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model checking with probabilistic tabled logic programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic inductive logic programming. Theory and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On applying or-parallelism and tabling to logic programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The PITA system: Tabling and answer subsumption for reasoning under uncertainty / rank | |||
Normal rank |
Latest revision as of 11:08, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Infinite probability computation by cyclic explanation graphs |
scientific article |
Statements
Infinite probability computation by cyclic explanation graphs (English)
0 references
10 December 2014
0 references
tabling
0 references
probability computation
0 references
prefix
0 references
probability equation
0 references
probabilistic logic programs
0 references
probabilistic context-free grammars
0 references