Dedicated tabling for a probabilistic setting
From MaRDI portal
Publication:2883085
Recommendations
- Tabling for infinite probability computation
- Infinite probability computation by cyclic explanation graphs
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- On the Efficient Execution of ProbLog Programs
- Model checking with probabilistic tabled logic programming
Cited in
(16)- Tabular, a schema-driven probabilistic programming language
- Stochastic table arrays
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- Model checking with probabilistic tabled logic programming
- A probabilistic model revealing shortcomings in Lua's hybrid tables
- A general approach to reasoning with probabilities
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- Tabling for infinite probability computation
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
- Probabilistic abstract argumentation frameworks, a possible world view
- Aspmc: new frontiers of algebraic answer set counting
- Compacting Boolean formulae for inference in probabilistic logic programming
- Probabilistic (logic) programming concepts
- Declarative probabilistic logic programming in discrete-continuous domains
- Infinite probability computation by cyclic explanation graphs
This page was built for publication: Dedicated tabling for a probabilistic setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883085)
