Swift Markov Logic for Probabilistic Reasoning on Knowledge Graphs
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
We provide a framework for probabilistic reasoning in Vadalog-based Knowledge Graphs (KGs), satisfying the requirements of ontological reasoning: full recursion, powerful existential quantification, expression of inductive definitions. Vadalog is a Knowledge Representation and Reasoning (KRR) language based on Warded Datalog+/-, a logical core language of existential rules, with a good balance between computational complexity and expressive power. Handling uncertainty is essential for reasoning with KGs. Yet Vadalog and Warded Datalog+/- are not covered by the existing probabilistic logic programming and statistical relational learning approaches for several reasons, including insufficient support for recursion with existential quantification, and the impossibility to express inductive definitions. In this work, we introduce Soft Vadalog, a probabilistic extension to Vadalog, satisfying these desiderata. A Soft Vadalog program induces what we call a Probabilistic Knowledge Graph (PKG), which consists of a probability distribution on a network of chase instances, structures obtained by grounding the rules over a database using the chase procedure. We exploit PKGs for probabilistic marginal inference. We discuss the theory and present MCMC-chase, a Monte Carlo method to use Soft Vadalog in practice. We apply our framework to solve data management and industrial problems, and experimentally evaluate it in the Vadalog system. Under consideration in Theory and Practice of Logic Programming (TPLP).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 4 of its 80 references that are in the map. First posted on arXiv 1 Oct 2022.
Builds on
4 of 80 references.
References · 4
- 2018The Vadalog System: Datalog-based Reasoning for Knowledge Graphscited by 25
- 2014Symmetric Weighted First-Order Model Countingcited by 19
- 2015Data Fusion: Resolving Conflicts from Multiple Sourcescited by 4
- 2018Data Science with Vadalog: Bridging Machine Learning and Reasoningcited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Neural Probabilistic Logic Learning for Knowledge Graph Reasoning
- 2025Inference of Abstraction for Grounded Predicate Logic
- 2024QUITE: Quantifying Uncertainty in Natural Language Text in Bayesian Reasoning Scenarios
- 2024Towards Trustworthy Knowledge Graph Reasoning: An Uncertainty Aware Perspective
- 2023Understanding ProbLog as Probabilistic Argumentation
- 2022FLEX: Feature-Logic Embedding Framework for CompleX Knowledge Graph Reasoning
- 2023Compositional Probabilistic and Causal Inference using Tractable Circuit Models
- 2024Reasoning over Uncertain Text by Generative Large Language Models