跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.13348 · v4

Adequate Losses via Quantitative Linear Logic

首次提交 2026-05-13 19:05
版本更新 2026-11-13 21:26
雷达观测 2026-11-16 11:41
arXiv ↗PDF ↗

摘要

As neural components are increasingly embedded in existing symbolic software -- including safety-critical systems -- the question arises of how to specify and enforce the safety of the newly introduced neural parts. Unlike traditional logical specifications, these must be amenable not only to the standard Boolean interpretation, but also to training and optimisation. The latter calls for a quantitative interpretation of the logical syntax, subject to further requirements such as smoothness and differentiability. Moreover, the qualitative and quantitative sides of the logic must share a unifying proof-theoretic and categorical semantics. Finally, the new logic should link cleanly to the substructural and program logics that underpin the verification of existing symbolic programs. In this paper, we present a logic that ticks all of these boxes. We introduce a family of calculi, ppQLL, indexed by a hardness degree pp, prove a cut-elimination theorem for them, and establish completeness with respect to enriched residuated `soft' lattices. At p=∞p = \infty, ppQLL reduces to multiplicative additive linear logic (MALL), and provability in ppQLL converges to provability in MALL as p→∞p \to \infty. We express optimisation objectives in the syntax of this logic and prove the quantitative adequacy of neuro-symbolic loss functions -- a result that has eluded the neuro-symbolic machine learning community for nearly a decade.

作者备注:Numerous tweaks and small corrections. To appear at POPL 2027

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-13 21:26 · 最新观测版本

Adequate Losses via Quantitative Linear Logic

As neural components are increasingly embedded in existing symbolic software -- including safety-critical systems -- the question arises of how to specify and enforce the safety of the newly introduced neural parts. Unlike traditional logical specifications, these must be amenable not only to the standard Boolean interpretation, but also to training and optimisation. The latter calls for a quantitative interpretation of the logical syntax, subject to further requirements such as smoothness and differentiability. Moreover, the qualitative and quantitative sides of the logic must share a unifying proof-theoretic and categorical semantics. Finally, the new logic should link cleanly to the substructural and program logics that underpin the verification of existing symbolic programs. In this paper, we present a logic that ticks all of these boxes. We introduce a family of calculi, ppQLL, indexed by a hardness degree pp, prove a cut-elimination theorem for them, and establish completeness with respect to enriched residuated `soft' lattices. At p=∞p = \infty, ppQLL reduces to multiplicative additive linear logic (MALL), and provability in ppQLL converges to provability in MALL as p→∞p \to \infty. We express optimisation objectives in the syntax of this logic and prove the quantitative adequacy of neuro-symbolic loss functions -- a result that has eluded the neuro-symbolic machine learning community for nearly a decade.

查看此版本解读 →查看此版本原文 ↗