Baobab compiles an OWL 2 DL (ΣROIQ) ontology with a finite ABox into a Sentential Decision Diagram (SDD), saturating a propositional core and instantiating remaining DL features over the active domain. The resulting evidence‑conditioned weighted model count trains a perception network to recognize real images under partial ABox supervision, enabling a CNN to recover latent ontology concepts that an independent perception would miss. When supervision allows multiple ontology‑consistent completions, Baobab’s mixture indexed by query justifications represents the calibrated posterior, achieving Bayes‑optimal performance on a real‑image MNIST task where single‑WMC and learned mixtures fail, thereby characterizing and mitigating reasoning shortcuts in a non‑Horn description logic.
By Olga Mashkova, Asaad Mohammedsaleh, Fernando Zhapa-Camacho, Robert Hoehndorf
arXiv:2608. 12961v1 Announce Type: new Abstract: The OWL 2 EL profile is used in some of the largest production ontologies, including the Gene Ontology and SNOMED CT.
By Olga Mashkova, Asaad Mohammedsaleh, Fernando Zhapa-Camacho, Robert Hoehndorf
arXiv:2607. 20402v1 Announce Type: new Abstract: In many reasoning problems, the premises are not observed as discrete symbols, but must be inferred from high-dimensional inputs.
By Wael AbdAlmageed
The OWL 2 EL profile is used in some of the largest production ontologies, including the Gene Ontology and SNOMED CT. Existing neuro-symbolic (NeSy) learning methods accept propositional theories or Datalog, and reasoning-shortcut (RS) awareness has not been investigated in ontology settings.
arXiv:2607. 22811v1 Announce Type: cross Abstract: Hybrid mechanistic/data-driven models, which combine first-principles with learned components, are increasingly used in process engineering and scientific machine learning.
By Moein E. Samadi, Andreas Schuppert
The paper argues that many AI tasks can be split into a deterministic core and a fuzzy residue, and that decomposing tasks rather than expanding models yields a property called parity by construction—where model‑size no longer affects performance on the deterministic sub‑tasks. Across nine models ranging from 494 M to Opus‑class size, the authors show that once the deterministic context is resolved, operation selection and selector resolution scores become identical, while a non‑decomposable task (labelling) remains sensitive to model size. They present a general method for identifying decomposition points, constructing deterministic surfaces and grammars, and ensuring safe residues, and demonstrate the approach in physics, motion retargeting, object‑model editing, and a Web‑CLI tool.
whyItMatters":"The study demonstrates that task decomposition can eliminate the need for model scaling or fine‑tuning, offering a systematic design discipline applicable across diverse AI domains."
By Tejaswi Gowda
A recurring design choice in building AI systems is whether, when a task is too hard for a model, to expand the model (make it larger, better-prompted, fine-tuned), or to decompose the task (extract t...
The paper introduces a neuro‑symbolic framework for scientific reasoning that separates symbolic validity and semantic groundedness. A deterministic symbolic verifier acts as a hard filter to guarantee syntactic and arithmetic correctness, while a Process Reward Model (PRM) is trained on verifier‑accepted steps to assess contextual grounding. The authors propose Counterfactual Symbolic Perturbation (CSP) to generate hard negative examples that pass the verifier but are logically flawed, enabling efficient PRM training and a verifier‑first constrained search at inference.
By Yuxin Zi, Cong Xu, Suparna Bhattacharya, Martin Foltin, Amit Sheth
The paper introduces CREAMs, a flexible framework for Concept Bottleneck Models that allows explicit encoding of concept‑concept and concept‑task relationships such as mutual exclusivity, hierarchy, and correlations. CREAMs can optionally use a regularized side‑channel to compensate for incomplete concept sets, maintaining competitive performance while encouraging concept‑grounded predictions. The authors also propose a new metric to assess interpretability when predictions partially rely on the side‑channel, and demonstrate that CREAMs support efficient interventions, avoid concept leakage, and match black‑box performance even with missing concepts.
By Nektarios Kalampalikis, Kavya Gupta, Georgi Vitanov, Isabel Valera
arXiv:2608. 10420v1 Announce Type: new Abstract: Reasoning shortcuts are solutions of a neurosymbolic system's rules that produce correct predictions through unintended concepts.
By Xin Xu
The paper introduces MACCHIATO, a training algorithm that builds a ReLU‑MLP from partial truth‑table data while simultaneously constructing an explicit Boolean circuit over AND, OR, and XOR gates that certifies the network’s computation. The method iteratively projects residuals onto low‑dimensional Boolean classes, compiles the resulting circuit into a ReLU‑MLP, and uses logic minimization and influence‑based variable selection to achieve a six‑layer network with provable truth‑table error bounds. Experiments on synthetic random‑junta tasks show that these certified networks outperform Adam‑trained MLPs in data‑sparse or projection‑aligned regimes and complete faster than flat ESPRESSO in certain settings.
By Hrad Ghoukasian, Anastasis Kratsios
SCOPE compiles natural‑language policies into neurosymbolic predicate programs that combine small neural models, deterministic extractors, and logical composition. The system is jointly optimized with adversarially generated counterexamples, achieving higher accuracy than prompt‑optimization, task‑decomposition, and workflow‑generation baselines on real‑world policy benchmarks. Programs trained with the weakest executor transfer to other models, enabling deployment on inexpensive models with stable, interpretable predictions.
By Arnon Mazza, Elad Levi