arXiv:2607.09338cs.CLcs.SC2026-07

用约束求解法自动检测对话生成中的逻辑矛盾。

Towards Detecting Inconsistencies in End-to-end Generated TODs

论文配图:Towards Detecting Inconsistencies in End-to-end Generated TODs
图 1 · 摘自论文原文
  • 将对话拆解为变量,用约束满足问题建模。
  • 在真实数据上检测准确率高,能定位错误点。
  • 适合需要高可靠性的任务型对话系统开发者。

生成式AI正深刻改变对话系统技术,推动从模块化向端到端架构演进。然而大语言模型(LLMs)仍可能生成不一致内容,这在任务型对话(TODs)中尤为严重——系统回应必须严格遵循领域知识库(如城市内的餐厅信息)。一个幻觉(如推荐不存在的餐厅)可能导致任务彻底失败。本文将TOD视为约束满足问题(CSP),其中变量代表涉及对话领域的段落,变量间的约束捕捉对话连贯性及对知识库的遵守。我们提出一个流水线:先识别目标对话中的变量,再使用CSP求解器寻找有效解。通过对比目标对话与有效变量赋值,可检测不一致性,并建议最小修改以保证一致性。实验表明该方法在检测不一致性方面具有高准确性,并提供了详细分析。

原文摘要 · Abstract (English)

Generative AI is profoundly transforming the core technologies behind conversational systems, shifting from component-based to end-to-end approaches. However, Large Language Models (LLMs) may still generate inconsistencies, a critical issue particularly in Task-Oriented Dialogues (TODs), where system responses must strictly adhere to information from a domain knowledge base (e.g., restaurants in a city). A single hallucination (e.g., suggesting a non-existent restaurant) can lead to severe task failures. We investigate a method for automatically detecting inconsistencies by conceptualizing TODs as a Constraint Satisfaction Problem (CSP), where variables represent dialogue segments referencing the conversational domain, and constraints among variables capture dialogue properties such as turn coherence and adherence to domain knowledge. We propose a pipeline that first identifies variables in a target dialogue and then applies a CSP solver to identify valid solutions. By comparing the target dialogue with valid variable assignments, we can detect inconsistencies and suggest minimal changes to ensure dialogue consistency. We demonstrate the high accuracy of the CSP-based approach in detecting inconsistencies, and provide a detailed analysis of our findings.

对话系统一致性检测约束求解

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