# VEL: A Formally Verified Reasoner for OWL2 EL Profile

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 27 references that are in the map.
- First posted on arXiv 11 Dec 2024.

## Builds on (most cited first, 2 of 2)

- [A Verified Optimizer for Quantum Circuits](https://mlsanity.com/paper/1912.02250/) (2019)
- [Towards a Coq formalization of a quantified modal logic](https://mlsanity.com/paper/2206.03358/) (2022)

## 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)

Over the past two decades, the Web Ontology Language (OWL) has been instrumental in advancing the development of ontologies and knowledge graphs, providing a structured framework that enhances the semantic integration of data. However, the reliability of deductive reasoning within these systems remains challenging, as evidenced by inconsistencies among popular reasoners in recent competitions. This evidence underscores the limitations of current testing-based methodologies, particularly in high-stakes domains such as healthcare. To mitigate these issues, in this paper, we have developed VEL, a formally verified EL++ reasoner equipped with machine-checkable correctness proofs that ensure the validity of outputs across all possible inputs. This formalization, based on the algorithm of Baader et al., has been transformed into executable OCaml code using the Coq proof assistant's extraction capabilities. Our formalization revealed several errors in the original completeness proofs, which led to changes to the algorithm to ensure its completeness. Our work demonstrates the necessity of mechanization of reasoning algorithms to ensure their correctness at theoretical and implementation levels.