arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.6790cs.LO
收藏

证明搜索模理论的公理化约束系统

Axiomatic constraint systems for proof search modulo theories

Damien Rouhling, Mahfuza Farooque, Stéphane Graham-Lengrand, Assia Mahboubi, Jean-Marc Notin

摘要:

一阶逻辑中的目标导向证明搜索使用元变量来延迟证人的选择;当关闭证明树分支时,使用一阶统一或特定于理论的背景推理器来产生这些变量的替换。本文探讨了这样的机制,从而产生理论特定的约束,而不是替代的概括。为了设计模块化的证明搜索过程中,这样的机制,我们提供了一个元变量,抽象地操纵这样的约束条件的微积分。证明微积分的可靠性和完备性导致了一个公理化,它确定了抽象约束可以以与统一器通常相同的方式生成和传播的条件。然后,我们提取我们的抽象框架的组件接口和规范的具体实现的背景推理。

英文摘要:

Goal-directed proof search in first-order logic uses meta-variables to delay the choice of witnesses; substitutions for such variables are produced when closing proof-tree branches, using first-order unification or a theory-specific background reasoner. This paper investigates a generalisation of such mechanisms whereby theory-specific constraints are produced instead of substitutions. In order to design modular proof-search procedures over such mechanisms, we provide a sequent calculus with meta-variables, which manipulates such constraints abstractly. Proving soundness and completeness of the calculus leads to an axiomatisation that identifies the conditions under which abstract constraints can be generated and propagated in the same way unifiers usually are. We then extract from our abstract framework a component interface and a specification for concrete implementations of background reasoners.

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

↑