mlsanityData to 14 Oct 2026

Beyond the Grounding Bottleneck: Datalog Techniques for Inference in Probabilistic Logic Programs (Technical Report)

arXiv 1911.07750 ↗First posted 18 Nov 2019cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

State-of-the-art inference approaches in probabilistic logic programming typically start by computing the relevant ground program with respect to the queries of interest, and then use this program for probabilistic inference using knowledge compilation and weighted model counting. We propose an alternative approach that uses efficient Datalog techniques to integrate knowledge compilation with forward reasoning with a non-ground program. This effectively eliminates the grounding bottleneck that so far has prohibited the application of probabilistic logic programming in query answering scenarios over knowledge graphs, while also providing fast approximations on classical benchmarks in the field.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Nov 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 0; 2023: 2; 2024: 0; 2025: 1; 2026: 1.

6 papers.