Dealing with negative conditions in automated proving: tools and challenges. The unexpected consequences of Rabinowitsch's trick

被引:4
作者
Ladra, Manuel [1 ]
Paez-Guillan, Pilar [1 ]
Recio, Tomas [2 ]
机构
[1] Univ Santiago, Inst Matemat, Dept Matemat, Santiago De Compostela, Spain
[2] Univ Cantabria, Dept Matemat Estadist & Computac, Santander, Spain
关键词
Automated proving; Automated discovery; Non-degeneracy conditions; Rabinowitsch's trick; Saturation; DISCOVERY; GEOMETRY; THEOREMS;
D O I
10.1007/s13398-020-00874-8
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In the algebraic-geometry-based theory of automated proving and discovery, it is often required that the user includes, as complementary hypotheses, some intuitively obvious non-degeneracy conditions. Traditionally there are two main procedures to introduce such conditions into the hypotheses set. The aim of this paper is to present these two approaches, namely Rabinowitsch's trick and the ideal saturation computation, and to discuss in detail the close relationships and subtle differences that exist between them, highlighting the advantages and drawbacks of each one. We also present a carefully developed example which illustrates the previous discussion. Moreover, the paper will analyze the impact of each of these two methods in the formulation of statements with negative theses, yielding rather unexpected results if Rabinowitsch's trick is applied. All the calculations have been carried out using the software Singular in the FinisTerrae 2 supercomputer.
引用
收藏
页数:16
相关论文
共 18 条
[1]   Development of automatic reasoning tools in GeoGebra [J].
Abanades, Miguel ;
Botana, Francisco ;
Kovacs, Zoltan ;
Recio, Tomas ;
Solyom-Gecse, Csilla .
ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 2016, 50 (03) :85-88
[2]   Towards the Automatic Discovery of Theorems in GeoGebra [J].
Abanades, Miguel ;
Botana, Francisco ;
Kovacs, Zoltan ;
Recio, Tomas ;
Solyom-Gecse, Csilla .
MATHEMATICAL SOFTWARE, ICMS 2016, 2016, 9725 :37-42
[3]  
[Anonymous], 1993, Texts and Monographs in Computer Science
[4]  
Barakat M., 2019, ARXIV191110411V2
[5]  
Barakat M., 2017, ARXIV170700925
[6]   On the Unavoidable Uncertainty of Truth in Dynamic Geometry Proving [J].
Botana F. ;
Recio T. .
Mathematics in Computer Science, 2016, 10 (1) :5-25
[7]  
Chou Shang-Ching, 1988, MATH ITS APPL, V41
[8]  
Dalzotto G, 2009, J AUTOM REASONING, V43, P203, DOI [10.1007/s10817-009-9133-x, 10.1007/s10817-009-9133-X]
[9]  
Decker W., 2019, Singular 4-1-2-A computer algebra system for polynomial computations
[10]   A REFUTATIONAL APPROACH TO GEOMETRY THEOREM-PROVING [J].
KAPUR, D .
ARTIFICIAL INTELLIGENCE, 1988, 37 (1-3) :61-93