mlsanityData to 13 Oct 2026

Approximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings

arXiv 2407.11821 ↗First posted 16 Jul 2024cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Statistical information is ubiquitous but drawing valid conclusions from it is prohibitively hard. We explain how knowledge graph embeddings can be used to approximate probabilistic inference efficiently using the example of Statistical EL (SEL), a statistical extension of the lightweight Description Logic EL. We provide proofs for runtime and soundness guarantees, and empirically evaluate the runtime and approximation quality of our approach.

Key facts. Cited by 5 papers in the map (data through 13 Oct 2026). Builds on 14 of its 47 references that are in the map. First posted on arXiv 16 Jul 2024.

Builds on

14 of 47 references.

References · 14

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,093
  2. 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 930
  3. 2020BoxE: A Box Embedding Model for Knowledge Base Completioncited by 105
  4. 2017Analogical Inference for Multi-Relational Embeddingscited by 69
  5. 2019EL Embeddings: Geometric construction of models for the Description Logic EL ++cited by 48
  6. 2020Improving Local Identifiability in Probabilistic Box Embeddingscited by 35
  7. 2022Faithiful Embeddings for EL++ Knowledge Basescited by 25
  8. 2021Probabilistic Box Embeddings for Uncertain Knowledge Graph Reasoningcited by 22
  9. 2023Dual Box Embeddings for the Description Logic EL++cited by 21
  10. 2022Description Logic EL++ Embeddings with Intersectional Closurecited by 16
  11. 2017Towards Statistical Reasoning in Description Logics over Finite Domains (Full Version)cited by 3
  12. 2021Mining EL Bases with Adaptable Role Depthcited by 3
2 more
  1. 2019Statistical EL is ExpTime-completecited by 2
  2. 2016Probabilistic Reasoning in the Description Logic ALCP with the Principle of Maximum Entropy (Full Version)cited by 1

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 3.

5 papers.

  1. 2025ArgRAG: Explainable Retrieval Augmented Generation using Quantitative Bipolar Argumentationcited by 12
  2. 2024DAGE: DAG Query Answering via Relational Combinator with Logical Constraintscited by 4
  3. 2026Scalable Uncertainty Reasoning in Knowledge Graphscited by 1
  4. 2026ProbSPARQL: Querying Knowledge Graphs with Multi-dimensional, Uncertain Numeric Datacited by 0
  5. 2026Uncertainty in Representation Learning on Knowledge Graphscited by 0