Redundancy Elimination in Lemma-Knowledge for Automated Theorem Provers

机译：自动定理证明的引理知识中的冗余消除

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Lemmatization is a promising way for solving "hard" problems with automated theorem provers. However, valuable results can only be reached, if the employed lemmata are restricted to useful records. The paper describes an algorithm for supporting such a restriction by eliminating redundancies in lemma-knowledge. Here, a lemma a is called redundant to a lemma set F, if a can be generated within very few inferences from F. Conflicts between redundacies are resolved with an importance criterion. First experiments give promising results.

机译：引理化是用自动定理证明者解决“难题”的一种有前途的方法。但是，只有将所使用的引词限制在有用的记录中才能获得有价值的结果。本文介绍了一种通过消除引理知识中的冗余来支持这种限制的算法。如果可以从F得出的极少推论中生成a，则引理a被称为引理集合F的冗余。冗余度之间的冲突可以通过重要性标准来解决。最初的实验给出了可喜的结果。

著录项

来源
《International Conference on Artificial Intelligence IC-AI'2000 Vol.3, Jun 26-29, 2000, Las Vegas, Nevada, USA》|2000年|p.1305-1309|共5页
会议地点 Las Vegas NV(US);Las Vegas NV(US)
作者
Joachim Draeger;
展开▼
作者单位

Institut fuer Informatik Technical University Munich D-80290 Miinchen, Germany;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类自动化技术、计算机技术;
关键词
theorem proving; modularization; lemmatization; redundancy elimination;

机译：定理证明模块化；词形化冗余消除;

相似文献

外文文献
中文文献
专利

1. A symbolic finite-state approach for automated proving of theorems in combinatorial game theory [J] . Thanatipanonda T, Zeilberger D Journal of difference equations and applications . 2009,第2期

机译：组合博弈论中自动证明定理的符号有限状态方法
2. AUTOMATED PROVING AND ANALYSIS OF GEOMETRIC THEOREMS IN COORDINATE-FREE FORM BY USING THE ANTICOMMUTATIVE GROEBNER BASIS METHOD [J] . I. J. Tchoupaeva Journal of Mathematical Sciences . 2006,第5期

机译：基于反对流格罗布纳法的无坐标形式几何定理的自动证明和分析
3. Eliminating Redundant Search Space on Backtracking for Forward Chaining Theorem Proving [J] . Lifeng He, Yuyan Chao, Hidenori Itoh Journal of Computer Science & Technology . 2003,第5期

机译：消除回溯上的冗余搜索空间，以进行前向链定理证明
4. Redundancy Elimination in Lemma-Knowledge for Automated Theorem Provers [C] . Joachim Draeger International conference on artificial intelligence . 2000

机译：LEMMA的冗余消除 - 自动定理普罗瓦知识
5. Automated theorem proving by translation to description logic. [D] . Arhami, Negin. 2015

机译：通过翻译成描述逻辑来自动证明定理。
6. A theorem proving approach for automatically synthesizing visualizations of flow cytometry data [O] . Sunny Raj, Faraz Hussain, Zubir Husein, 2017

机译：自动合成流式细胞仪数据可视化的定理证明方法
7. Automated Theorem Proving in Incidence Geometry – A Bracket Algebra Based Elimination Method [O] . Hongbo Li, Yihong Wu 2014

机译：关联几何中的自动定理证明 - 基于支架代数的消元法

Redundancy Elimination in Lemma-Knowledge for Automated Theorem Provers

摘要

著录项

相似文献

相关主题

期刊订阅