Baobab is presented, which is to the authors' knowledge the first to characterize and mitigate reasoning shortcuts in a non-Horn description logic and machine-checked in Lean 4.
Abstract
OWL 2 DL ontologies, grounded in the description logic $\mathcal{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 $\mathcal{EL}^{++}$, which has a single canonical model. We present Baobab, which compiles a $\mathcal{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 $\mathcal{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 $\mathcal{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.
Moose improves over propositional-NeSy, fuzzy-logic, and ontology embedding baselines, and presents the first reasoning-shortcut analysis in an OWL EL setting.
O. Mashkova, Asaad Mohammedsaleh, Fernando Zhapa-Camacho et al.· 0 citations
The framework is operator-agnostic - it decouples logical structure from the choice of underlying continuous semantics, revealing, through the first controlled comparison of its kind, that this choice alone can swing performance by over 30 points on the same task.
Zi-Han Shao, Chang Lu, Renate A. Schmidt et al.· Proceedings of the 32nd ACM...· 0 citations
The Concept Tree Learner is introduced, an incremental and interpretable symbolic framework that induces logical concepts over binary strings from minimal labeled data and generalizes substantially better to unseen strings than both a classical entropy-based decision tree and the RIPPER rule learner.
Muhammed Tekin Ertekin, Burkay Genç· Applied Sciences· 0 citations
A neuro-symbolic framework that cleanly decouples reasoning into two formal dimensions: Symbolic Validity and Semantic Groundedness is proposed, which significantly improves reasoning reliability without the sprawling heuristics of prior frameworks.
Yu-Xin Zi, Cong Xu, Suparna Bhattacharya et al.· 0 citations
A principled, verifiable semantic communication method is developed using a random-support Dirichlet--Categorical model of inductive logical probability, providing a modern statistical reinterpretation of Carnap's and Hintikka's systems.
This overview addresses this issue by providing a gentle introduction to RSs, discussing their causes and consequences in intuitive terms, and details methods for dealing with RSs, including mitigation and awareness strategies, and maps their benefits and limitations.
E. Marconato, Samuele Bortolotti, Emile van Krieken et al.· Journal of Artificial Intell...· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.