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

一阶逻辑定理证明与近似实例化建模

First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation

Andreas Teucke, Christoph Weidenbach

摘要:

在本文中,我们考虑一阶逻辑定理证明和模型建立通过近似和实例化。给定一个子句集,我们提出了一个简化的子句集,满足性是可判定的近似。近似扩展了签名并保留了不可满足性:如果简化的子句集在某些模型中是可满足的,那么在原始签名中解释的同一模型中的原始子句集也是可满足的。由简化子句集上的决策过程生成的反驳然后可以被提升到原始子句集中的反驳,或者它引导排除先前发现的不可提升的反驳的细化。这种方法是反驳完整的。我们不逐步提升反驳,但冲突的核心,有限的不可满足子句集代表至少一个反驳。该方法是双重的许多现有的方法在文献中,因为我们的近似保留不可满足性。

英文摘要:

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it guides a refinement excluding the previously found unliftable refutation. This way the approach is refutationally complete. We do not step-wise lift refutations but conflicting cores, finite unsatisfiable clause sets representing at least one refutation. The approach is dual to many existing approaches in the literature because our approximation preserves unsatisfiability.

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

↑