Portfolio theorem proving and prover runtime prediction for geometry

被引:0
|
作者
Mladen Nikolić
Vesna Marinković
Zoltán Kovács
Predrag Janičić
机构
[1] University of Belgrade,Faculty of Mathematics
[2] The Priv. Univ. College of Educ. of the Diocese of Linz,undefined
关键词
Algorithmic portfolios; Runtime prediction; Automated theorem proving in geometry; 68T05; 68T15; 03B35;
D O I
暂无
中图分类号
学科分类号
摘要
In recent years, portfolio problem solving found many applications in automated reasoning, primarily in SAT solving and in automated and interactive theorem proving. Portfolio problem solving is an approach in which for an individual instance of a specific problem, one particular, hopefully most appropriate, solving technique is automatically selected among several available ones and used. The selection usually employs machine learning methods. To our knowledge, this approach has not been used in automated theorem proving in geometry so far and it poses a number of new challenges. In this paper we propose a set of features which characterize a specific geometric theorem, so that machine learning techniques can be used in geometry. Relying on these features and using different machine learning techniques, we constructed several portfolios for theorem proving in geometry and also runtime prediction models for provers involved. The evaluation was performed on two corpora of geometric theorems: one coming from geometric construction problems and one from a benchmark set of the GeoGebra tool. The obtained results show that machine learning techniques can be useful in automated theorem proving in geometry, while there is still room for further progress.
引用
收藏
页码:119 / 146
页数:27
相关论文
共 50 条