A novel and interpretable approach to perform symbolic integration using deep learning through integral rule prediction to speed up the search and introduces the first-of-its-kind symbolic integration rules dataset comprising two million distinct functions and integration rule pairs.
Recent advancements in neuro-symbolic learning (NeSy) have shown significant promise in integrating deep learning with symbolic reasoning, offering both interpretability and generalization. However, the prevalence of reasoning shortcuts, where the NeSy system predicts incorrect intermediate concepts while maintaining high final accuracy, poses a substantial challenge. This is especially problematic in domains requiring reliable and transparent decision-making. Inspired by recent theories, we find that existing methods fail to address the reasoning shortcut issue when the knowledge base lacks sufficient complexity, highlighting their vulnerability in real-world applications. In this work, we present a novel method called DKA to address this issue. It introduces a limited set of concept-supervised data to enhance the knowledge base, effectively solving the reasoning shortcut problem and improving the applicability of the NeSy system. Theoretical analysis reveals that DKA can reduce shortcut risks with improved data efficiency. Empirical studies across multiple tasks within various neuro-symbolic frameworks also verify the effectiveness of the DKA method.
Yu-Feng Li, Xiaowen Yang, Wenda Wei et al.· Proceedings of the 32nd ACM...· 0 citations
Background: Deep neural networks increasingly power language, vision, and decision systems, yet many deployments require explanations that are faithful, compositional, and governance-ready. Symbolic techniques promise these properties, but the literature mixes post-hoc extraction, knowledge injection, and intrinsically hybrid designs without a unifying view.
Objectives: We provide a systematic review and synthesis of symbolic explainable AI (XAI) for deep learning (January 2017– June 2025), organize the field around a three-part taxonomy—Symbolic Knowledge Extraction (SKE), Symbolic Knowledge Injection (SKI), and Hybrid neurosymbolic architectures—and propose a conceptual framework that clarifies training–inference flows, explanation interfaces, human feedback, and governance touchpoints.
Methods: Beginning from ≈50,000 records, we deduplicated and screened full texts, analyzed 393 PDFs, and included 273 primary studies in the synthesis. We coded each paper for model domain, modality, symbolic formalism, explanation scope and stage, evaluation protocol, and governance alignment. Analyses combine descriptive statistics with stratification by domain and formalism; we qualitatively assess evidence for faithfulness, robustness, data efficiency, and constraint satisfaction.
Results: Research activity accelerates after 2020, with a marked turn toward hybrids. Across the corpus, SKE, SKI, and Hybrid account for approximately 29%, 26%, and 45% of studies, respectively. Rule sets/decision trees remain the dominant explanation artifacts, while logic- and program-based formalisms grow in NLP and planning. SKI most often targets constraint satisfaction and robustness improvements; SKE emphasizes global surrogates and faithfulness auditing; hybrids report gains in sample efficiency and traceable reasoning. However, evaluation practices are heterogeneous, human-subject studies are scarce, and explicit links to policy/risk controls appear in a minority of works.
Conclusions: Our framework unifies how data, priors, and symbolic reasoning interact with neural learners, the explanation interface, human stakeholders, and governance. We distill actionable recommendations: (1) report faithfulness and constraintsatisfaction metrics alongside accuracy; (2) specify symbolic assumptions and training-time injections precisely; (3) include user studies or auditor-centric protocols for high-stakes use; and (4) develop benchmarks that couple tasks with machinereadable knowledge bases. We highlight open problems in scalable formal reasoning with foundation models, verifying generated rationales, and measuring causal faithfulness at scale.
Eduard Ionel Stan, G. Sciavicco, Paolo Napoletano· Journal of Artificial Intell...· 0 citations
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
This paper proposes combining a Constraint Programming model with a Masked Language Model ( mlm) to perform Large Neighbourhood Search ( lns), and shows that it can quickly generate many high-quality sentences and molecules, even for highly-constrained tasks.
Arnaud Delage-Reid, Gilles Pesant, Amal Zouaq· International Conference on...· 0 citations
SymBOL accurately recovers governing equations and provides interpretable pathways for equation discovery when applied to real-world systems in materials science and epidemiology, and underscores the potential of SymBOL for advancing scientific discovery.
Jiaxu Cui, Qifei Li, Wei-Ting Liu et al.· IEEE Transactions on Pattern...· 0 citations
Although performance of language-based models is improved by scaling, whether the gap to a structure-aware architecture can eventually be eliminated remains untested.
Kiyan Rezaee· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.