arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.19199cs.LO
收藏

重写与归纳推理

Rewriting and Inductive Reasoning

Márton Hajdu, Laura Kovács, Michael Rawson

AI总结:

针对传统重写在归纳推理中遗漏关键后承的问题,本文扩展 superposition 演算以在饱和中自动生成充分后承,并在 Vampire 上验证其单元等式归纳推理性能显著提升。

摘要:

基于归约序的重写技术会生成“恰到好处”的逻辑后承,以保持一阶完备性。这对基于叠加的一阶定理证明非常理想;但我们证明,对于至少一种归纳推理方法,这种做法会遗漏关键后承。因此,我们用基于重写的技术扩展 superposition(叠加)演算,以生成足够的后承,从而在饱和过程中实现归纳自动化。将该工作应用于 unit-equational(单元等式)片段时,我们在定理证明器 Vampire 上的实验显示,归纳推理性能获得显著提升。

英文摘要:

Rewriting techniques based on reduction orderings generate "just enough" consequences to retain first-order completeness. This is ideal for superposition-based first-order theorem proving, but for at least one approach to inductive reasoning we show that we are missing crucial consequences. We therefore extend the superposition calculus with rewriting-based techniques to generate sufficient consequences for automating induction in saturation. When applying our work within the unit-equational fragment, our experiments with the theorem prover Vampire show significant improvements for inductive reasoning.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑