摘要
前提选择是提高定理自动证明成功率的关键技术,可以根据证明目标的相关性选择最有可能成功证明当前猜想的引理。已有的前提选择算法推荐的引理相关度不高,无法进一步提高定理的自动证明能力。针对以上问题,文章提出一种基于机器学习分类算法的组合方案,从公式结构和符号之间的依赖关系出发,提取有效特征向量集,并在k-近邻算法和朴素贝叶斯算法的基础上引入LDA主题词提取技术,进一步捕捉符号和依赖项之间的相关性,使得最后的组合算法预测的准确性更高。实验结果表明,该方案推荐的引理比现有的前提选择算法相关性更高,可以有效提高定理自动证明的成功率。
Premise selection is the key technology to improve the success rate of automatic theorem provfl It can choose the lemma which is most likely to prove the current conjecture successfully according to the relevance of the proving goal.However,the relevance of the lemmas recommended by the existing premise selection algorithm is not high,and the automatic proof ability of the theorem cannot be further improved.To solve the above problems,a combination algorithm based on machine learning classification is proposed.The scheme starts from the relationship between formula structure and symbols,extracts effective feature vector set,and introduces LDA topics extraction techniques on the basis of^-nearest neighbor algorithm and naive Bayes algorithm to farther capture the correlation between symbols and dependencies,which makes the final combination algorithm more accurate.Experimental results show that this method has higher accuracy than that the existing premise selection algorithm,and can effectively improve the success rate of automatic theorem provf.
作者
熊焰
程传虎
武建双
黄文超
XIONG Yan;CHENG Chuanhu;WU Jianshuang;HUANG Wenchao(Department of Computer Science and Technology,University of Science and Technology of China,Hefzi 230026,China;Department of Cyberspace Security,University of Science and Technology of China,Hefei 230026,China;Hefei Tianwei Information Security Technology Co.,Ltd,Hefei 230009,China)
出处
《信息网络安全》
CSCD
北大核心
2021年第11期9-16,共8页
Netinfo Security
基金
国家自然科学基金[61972369]。