  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.
