# The Shape of EL Proofs: A Tale of Three Calculi (Extended Version)

arXiv: https://arxiv.org/abs/2507.21851 · HTML: https://mlsanity.com/paper/2507.21851/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Jul 2025.

## Built on by (most cited first, 1 of 1)

- [Moose: Latent concept learning with reasoning-shortcut awareness in EL++](https://mlsanity.com/paper/2608.12961/) (2026)

## Abstract (arXiv)

Consequence-based reasoning can be used to construct proofs that explain entailments of description logic (DL) ontologies. In the literature, one can find multiple consequence-based calculi for reasoning in the EL family of DLs, each of which gives rise to proofs of different shapes. Here, we study three such calculi and the proofs they produce on a benchmark based on the OWL Reasoner Evaluation. The calculi are implemented using a translation into existential rules with stratified negation, which had already been demonstrated to be effective for the calculus of the ELK reasoner. We then use the rule engine NEMO to evaluate the rules and obtain traces of the rule execution. After translating these traces back into DL proofs, we compare them on several metrics that reflect different aspects of their complexity.