Neuro-symbolic learning over OWL 2 DL via consequence-based compilation to differentiable circuits
Not on the map. Why?
Abstract (arXiv)
OWL 2 DL ontologies, grounded in the description logic SROIQ, express large knowledge bases in biomedicine and the Semantic Web. Neuro-symbolic (NeSy) learners over description logics either embed the ontology in a continuous space, abandoning classical entailment, or restrict to the Horn fragment EL++, which has a single canonical model. We present Baobab, which compiles a SROIQ ontology with a finite ABox into a Sentential Decision Diagram (SDD): it saturates a propositional core under a consequence-based calculus and instantiates the remaining SROIQ features (nominals, number restrictions, and the role axioms) over the active domain. The SDD's evidence-conditioned weighted model count then trains a perception network to recognize real images under partial ABox supervision: on an ontology that exercises every distinctive SROIQ feature, a CNN learns to read MNIST digits coupled by a successor relation and recovers latent ontology concepts that an independent perception leaves at chance. When the supervision admits several ontology-consistent completions, an independent perception collapses onto one, a reasoning shortcut: we show that a mixture indexed by the query's justifications can represent the calibrated posterior no independent perception can, and that seeding it from the circuit's enumerated completions attains the Bayes-optimal posterior on a real-image MNIST task where single-WMC and learned mixtures (the BEARS-ensemble hypothesis class) do not: to our knowledge the first to characterize and mitigate reasoning shortcuts in a non-Horn description logic. Soundness of the compiler and the representation result are machine-checked in Lean 4. Code is available at https://github.com/bio-ontology-research-group/baobab.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 44 references that are in the map. First posted on arXiv 18 Aug 2026.
Builds on
23 of 44 references.
References · 23
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 394
- 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 270
- 2020Logical Neural Networkscited by 119
- 2022Semantic Probabilistic Layers for Neuro-Symbolic Learningcited by 103
- 2023NeurASP: Embracing Neural Networks into Answer Set Programmingcited by 92
- 2020OWL2Vec*: Embedding of OWL Ontologiescited by 63
- 2023Scallop: A Language for Neurosymbolic Programmingcited by 63
- 2023Not All Neuro-Symbolic Concepts Are Created Equal: Analysis and Mitigation of Reasoning Shortcutscited by 63
- 2021DeepStochLog: Neural Stochastic Logic Programmingcited by 58
- 2022A-NeSI: A Scalable Approximate Method for Probabilistic Neurosymbolic Inferencecited by 50
- 2019EL Embeddings: Geometric construction of models for the Description Logic EL ++cited by 48
11 more
- 2024BEARS Make Neuro-Symbolic Models Aware of their Reasoning Shortcutscited by 37
- 2022NeuPSL: Neural Probabilistic Soft Logiccited by 34
- 2022Faithiful Embeddings for EL++ Knowledge Basescited by 25
- 2023Dual Box Embeddings for the Description Logic EL++cited by 21
- 2024A Neuro-Symbolic Benchmark Suite for Concept Quality and Reasoning Shortcutscited by 19
- 2024On the Independence Assumption in Neurosymbolic Learningcited by 18
- 2025Neurosymbolic Diffusion Modelscited by 13
- 2016Extending Consequence-Based Reasoning to SRIQcited by 3
- 2026To Neuro-Symbolic Classification and Beyond by Compiling Description Logic Ontologies to Probabilistic Circuitscited by 3
- 2018Consequence-based Reasoning for Description Logics with Disjunction, Inverse Roles, Number Restrictions, and Nominalscited by 2
- 2025Neurosymbolic Reasoning Shortcuts under the Independence Assumptioncited by 2
Built on by
Not cited yet.