Scalable Uncertainty Reasoning in Knowledge Graphs

• URL: http://arxiv.org/abs/2605.16568v1
• Date: Fri, 15 May 2026 19:16:10 GMT
• Title: Scalable Uncertainty Reasoning in Knowledge Graphs
• Abstract summary: Knowledge Graphs are pivotal for semantic data integration.<n>Uncertainty manifests in three distinct levels: imprecise attribute values, probabilistic triple existence, and incomplete schema knowledge.<n>I aim to develop a modular framework that addresses each level through tailored techniques.
• Score: 2.402069202602609
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Knowledge Graphs are pivotal for semantic data integration. The real-world data they model is often inherently uncertain. Within knowledge graphs, uncertainty manifests in three distinct levels: imprecise attribute values, probabilistic triple existence, and incomplete schema knowledge. However, current Semantic Web standards lack native support for reasoning over such uncertainty, and naïve extensions often incur computational intractability. In this thesis, I aim to develop a modular framework that addresses each level through tailored techniques: (1) defining probabilistic literals and a corresponding query algebra for continuous attributes; (2) a compilation-based framework transforming SPARQL provenance into tractable probabilistic circuits for uncertain triples; and (3) topology-aware geometric embeddings for statistical schema reasoning. The central hypothesis is that specialized reasoning mechanisms, namely algebraic, logical, and geometric approaches, can reconcile semantic precision with computational tractability.

Related papers

• On the evolution of the concept of probability as a mirror of the evolution of reason [31.458406135473805]
  Article interprets that evolution not merely as a mathematical history, but as a transformation of rationality itself.<n>Probability theory has grown from the calculus of games of chance into a central framework for reasoning under uncertainty.<n> Fuzzy logic is presented as a rigorous language for graded meaning and qualitative judgment, while deep learning is analyzed as a powerful mode of prediction.
  arXiv  Detail & Related papers  (2026-05-26T08:58:53Z)
• State Algebra for Probabilistic Logic [0.0]
  This paper presents a Probabilistic State Algebra as an extension of deterministic propositional logic.<n>By mapping logical states to real-valued coordinates interpreted as energy potentials, we define an energy-based model.<n>We demonstrate that this algebra constructs formal Gibbs distributions, offering a rigorous mathematical link between symbolic constraints and statistical inference.
  arXiv  Detail & Related papers  (2026-03-13T20:28:45Z)
• $γ(3,4)$ `Attention' in Cognitive Agents: Ontology-Free Knowledge Representations With Promise Theoretic Semantics [0.0]
  Semantic and dynamics of attention' are closely related to promise theoretic notions developed for autonomous agents.<n>One may establish a bridge between vectorized Machine Learning and Knowledge Graph representations.
  arXiv  Detail & Related papers  (2025-12-22T06:48:53Z)
• Probabilistic Graphical Models: A Concise Tutorial [67.95025153592505]
  Probabilistic graphical modeling is a branch of machine learning that uses probability distributions to describe the world.<n>This tutorial provides a concise introduction to the formalisms, methods, and applications of this modeling framework.
  arXiv  Detail & Related papers  (2025-07-23T01:36:44Z)
• stl2vec: Semantic and Interpretable Vector Representation of Temporal Logic [0.5956301166481089]
  We propose a semantically grounded vector representation (feature embedding) of logic formulae. We compute continuous embeddings of formulae with several desirable properties. We demonstrate the efficacy of the approach in two tasks: learning model checking and neurosymbolic framework.
  arXiv  Detail & Related papers  (2024-05-23T10:04:56Z)
• Extending Complex Logical Queries on Uncertain Knowledge Graphs [50.360531130930646]
  The study of machine learning-based logical query answering enables reasoning with large-scale and incomplete knowledge graphs.<n>We propose a neural symbolic approach that incorporates both forward inference and backward calibration to answer soft queries on large-scale, incomplete, and uncertain knowledge graphs.
  arXiv  Detail & Related papers  (2024-03-03T13:13:53Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• Probabilistic Box Embeddings for Uncertain Knowledge Graph Reasoning [36.34170367603253]
  We propose BEUrRE, a novel uncertain knowledge graph embedding method with calibrated probabilistic semantics. experiments on two benchmark datasets show that BEUrRE consistently outperforms baselines on confidence prediction and fact ranking.
  arXiv  Detail & Related papers  (2021-04-09T21:01:52Z)
• Don't Just Blame Over-parametrization for Over-confidence: Theoretical Analysis of Calibration in Binary Classification [58.03725169462616]
  We show theoretically that over-parametrization is not the only reason for over-confidence. We prove that logistic regression is inherently over-confident, in the realizable, under-parametrized setting. Perhaps surprisingly, we also show that over-confidence is not always the case.
  arXiv  Detail & Related papers  (2021-02-15T21:38:09Z)
• Paraconsistent Foundations for Probabilistic Reasoning, Programming and Concept Formation [0.0]
  It is argued that 4-valued paraconsistent truth values (called here "p-bits") can serve as a conceptual, mathematical and practical foundation for highly AI-relevant forms of probabilistic logic and programming and concept formation. It is shown that appropriate averaging-across-situations and renormalization of 4-valued p-bits operating in accordance with Constructible Duality (CD) logic yields PLN (Probabilistic Logic Networks) strength-and-confidence truth values.
  arXiv  Detail & Related papers  (2020-12-28T20:14:49Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)
• Neuro-symbolic Architectures for Context Understanding [59.899606495602406]
  We propose the use of hybrid AI methodology as a framework for combining the strengths of data-driven and knowledge-driven approaches. Specifically, we inherit the concept of neuro-symbolism as a way of using knowledge-bases to guide the learning progress of deep neural networks.
  arXiv  Detail & Related papers  (2020-03-09T15:04:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.