arXiv:2512.16770cs.CLcs.AI2025-12

让自然语言转时序逻辑更准,通过系统签名精准映射语义。

GinSign: Grounding Natural Language Into System Signatures for Temporal Logic Translation

  • 将自然语言到时序逻辑的映射分解为谓词分类与参数选择两步,降低复杂度。
  • 在多个领域测试中实现95.5%的语义等价率,优于当前最优方法一倍以上。
  • 适合需要高可靠形式化验证的自动驾驶、控制系统等可信系统开发人员。

自然语言(NL)到时序逻辑(TL)的转换使工程师无需手动编写形式规范即可定义、验证和强制执行系统行为,这对构建可信自主系统至关重要。现有框架或假设可获得准确的原子映射,或存在接地翻译准确率低的问题。本文提出GinSign框架,用于将自然语言嵌入系统签名以进行时序逻辑翻译。该框架引入一个接地模型,学习将自然语言片段映射到给定系统签名的任务:给定一个提升的自然语言规范和系统签名$ℝ$,分类器需将每个提升的原子命题分配至签名定义的原子集合$ℝ$中的元素。我们采用分层分解方式——先预测谓词标签,再选择适当类型的常量参数。将原本自由生成的问题转化为结构化分类问题,使小型掩码语言模型得以应用,无需依赖昂贵的大语言模型。多领域实验表明,忽略接地的框架虽能生成语法正确的提升LTL,但语义上与目标表达式不等价;而本框架支持下游模型检验,并达到95.5%的接地逻辑等价率,较现有最佳方法提升1.4倍。

原文摘要 · Abstract (English)

Natural language (NL) to temporal logic (TL) translation enables engineers to specify, verify, and enforce system behaviors without manually crafting formal specifications-an essential capability for building trustworthy autonomous systems. While existing NL-to-TL translation frameworks have demonstrated encouraging initial results, these systems either explicitly assume access to accurate atom grounding or suffer from low grounded translation accuracy. In this paper, we propose a framework for Grounding Natural Language Into System Signatures for Temporal Logic translation called GinSign. The framework introduces a grounding model that learns the abstract task of mapping NL spans onto a given system signature: given a lifted NL specification and a system signature $\mathcal{S}$, the classifier must assign each lifted atomic proposition to an element of the set of signature-defined atoms $\mathcal{P}$. We decompose the grounding task hierarchically -- first predicting predicate labels, then selecting the appropriately typed constant arguments. Decomposing this task from a free-form generation problem into a structured classification problem permits the use of smaller masked language models and eliminates the reliance on expensive LLMs. Experiments across multiple domains show that frameworks which omit grounding tend to produce syntactically correct lifted LTL that is semantically nonequivalent to grounded target expressions, whereas our framework supports downstream model checking and achieves grounded logical-equivalence scores of $95.5\%$, a $1.4\times$ improvement over SOTA.

时序逻辑自然语言系统验证形式化方法

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