Pith. sign in

REVIEW 1 cited by

Approximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.11821 v2 pith:FUQHRZLJ submitted 2024-07-16 cs.AI

Approximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings

classification cs.AI
keywords statisticalembeddingsgraphinferenceknowledgeprobabilisticruntimeapproach
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SCAIR: Schema-Conditioned Agentic Iterative Reasoning for Enterprise Knowledge Graphs

    cs.AI 2026-06 conditional novelty 5.0

    SCAIR, a training-free schema-conditioned agentic KG-RAG method, substantially outperforms existing KG-RAG approaches on a new enterprise CMDB benchmark, but the evaluation has notable confounds.