VEL is a Coq-verified EL++ subsumption reasoner with extracted OCaml code; the formalization found two errors in Baader et al.'s completeness proof and fixed them with an A-extension and a strengthened lemma.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
VEL: A Formally Verified Reasoner for OWL2 EL Profile
VEL is a Coq-verified EL++ subsumption reasoner with extracted OCaml code; the formalization found two errors in Baader et al.'s completeness proof and fixed them with an A-extension and a strengthened lemma.