用模型检验提升教育领域问答的推理可信度
Formal Reasoning for Intelligent QA Systems: A Case Study in the Educational Domain
- 结合大模型与模型检验,实现可验证的逻辑推理
- 在真实学术流程数据集上,推理准确率显著提升
- 适合高风险场景如教育评估、合规审查
推理对封闭领域问答系统至关重要,尤其在程序正确性和政策合规性要求高的场景。尽管大语言模型在多项推理任务中表现优异,但其推理过程常缺乏真实性,更像是合理的解释而非因果推导。现有将大模型与符号引擎(如Prover9、Z3)结合的方法虽提升了可靠性,但仍局限于静态逻辑,难以处理多步进展和条件转移等动态状态推理。本文提出MCFR(模型检验用于形式化推理),一种神经符号框架,将自然语言转化为形式化规范并在转换模型上进行性质验证。为支持评估,我们构建了基于真实学术流程的EduMC-QA基准数据集。实验结果表明,MCFR显著提升了推理的忠实性与可解释性,为高风险封闭领域问答提供了可验证的解决方案。此外,我们还将MCFR与ChatGPT、DeepSeek、Claude等先进大模型对比,验证其有效性。
原文摘要 · Abstract (English)
Reasoning is essential for closed-domain QA systems in which procedural correctness and policy compliance are critical. While large language models (LLMs) have shown strong performance on many reasoning tasks, recent work reveals that their reasoning traces are often unfaithful - serving more as plausible justifications than as causally grounded derivations. Efforts to combine LLMs with symbolic engines (e.g., Prover9, Z3) have improved reliability but remain limited to static forms of logic, struggling with dynamic, state-based reasoning such as multi-step progressions and conditional transitions. In this paper, we propose MCFR (Model Checking for Formal Reasoning), a neuro-symbolic framework that integrates LLMs with model checking to support property verification. MCFR translates natural language into formal specifications and verifies them over transition models. To support evaluation, we introduce EduMC-QA, a benchmark dataset grounded in real academic procedures. Our results show that MCFR improves reasoning faithfulness and interpretability, offering a viable path toward verifiable QA in high-stakes closed-domain applications. In addition to evaluating MCFR, we compare its performance with state-of-the-art LLMs such as ChatGPT, DeepSeek, and Claude to contextualize its effectiveness.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。