检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:汤晓凌[1]
出 处:《计算机工程与设计》2006年第22期4378-4382,共5页Computer Engineering and Design
摘 要:集合论定理机器证明,至今在国内外尚无相关研究。虽然集合论在数学领域中所处的基础地位显得在这一领域实现机械化极其重要,但是多年来尚无进展。到目前为止,还没有发现能产生可读证明的系统。通过对人工智能搜索算法的研究,提出了集合论等式型定理证明的机械化方法。实现的系统能自动生成定理的可读证明以及相关的说明。Up to the present, there isn't related research about automated theorem proving of set theory in domestic and overseas. Though the basic status of set theory in the field of mathematics looks realizing mechanization in this field very important, there isn't any evolving year in year out. At present, there isn't found any system of producing understandable proof. Through the research of artificial intelligence search arithmetic, the mechanization method of automated theorem proving of equation theorem of set theory is proposed. The system can automated produce understandable proof of set theorem and related explain.
关 键 词:智能模拟机械化 人工智能 定理机器证明 集合论 可读证明
分 类 号:TP387[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249