arXiv:2607.21185cs.AIcs.LO2026-07被引 1

用可微逻辑编程减少神经符号系统中的推理捷径

Differentiable Logic Programming to Mitigate Reasoning Shortcuts in Neurosymbolic Systems

论文配图:Differentiable Logic Programming to Mitigate Reasoning Shortcuts in Neurosymbolic Systems
图 1 · 摘自论文原文
  • 用矩阵统一编码规则与约束,实现可微逻辑推理
  • 在MNIST变体上,一对一映射显著降低两类推理捷径
  • 揭示符号知识与神经学习耦合方式对防捷径的关键作用

神经符号系统结合神经网络与逻辑推理以实现泛化与可解释性,但近期研究发现其易产生推理捷径。本文提出基于矩阵的可微逻辑编程方法,缓解两类捷径:约束满足捷径(仅满足约束未完成任务)与认知捷径(数据偏倚导致语义错误概念映射)。基于最新矩阵逻辑语义,设计统一规则与约束编码矩阵,并关联模糊逻辑t-范数,实证比较梯度传播特性。在MNIST变体上的实验表明,将神经输出一对一映射到逻辑原子,相比依赖软概率分布的方法,显著减少两类捷径。进一步验证了符号知识与神经学习耦合架构在抑制捷径中的决定性作用。

原文摘要 · Abstract (English)

Neurosymbolic (NeSy) systems integrate neural networks with logical reasoning to achieve both generalization and interpretability, but recent work has shown they are susceptible to shortcut reasoning behaviors. We propose a novel method using matrix-based differentiable logic programming to mitigate reasoning shortcuts in two phenomena: constraint satisfaction shortcuts, where constraints are satisfied without achieving the intended task, and cognition shortcuts, where biased data leads to semantically incorrect concept mappings despite logically sound inference. Building on recent matrix-based logic programming semantics, we introduce design elements to mitigate shortcuts, including a unified encoding of rules and constraints in a single matrix. We also identify connections to fuzzy logic t-norms and empirically compare their gradient flow properties. Through carefully designed experiments on MNIST variants, we show that one-to-one grounding of neural outputs to logical atoms significantly reduces both shortcut types compared to previous methods that rely on soft probability distributions. We then confirm that architectural choices in coupling symbolic knowledge with neural learning play a critical role in shortcut mitigation.

神经符号可微逻辑推理捷径模型可解释性

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。