Multi-Context Automated Lemma Generation for Term Rewriting Induction with Divergence Detection

被引:0
作者
Ji, Chengcheng [1 ]
Kurihara, Masahito [1 ]
Sato, Haruhiko [2 ]
机构
[1] Hokkaido Univ, Grad Sch Informat Sci & Technol, Sapporo, Hokkaido 0600814, Japan
[2] Hokkai Gakuen Univ, Fac Engn, Sapporo, Hokkaido 0640926, Japan
关键词
term rewriting systems; term rewriting induction; multi-context induction; lemma generation; TERMINATION; COMPLETION;
D O I
10.1587/transinf.2017EDP7368
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We present an automated lemma generation method for equational, inductive theorem proving based on the term rewriting induction of Reddy and Aoto as well as the divergence critic framework of Walsh. The method effectively works by using the divergence-detection technique to locate differences in diverging sequences, and generates potential lemmas automatically by analyzing these differences. We have incorporated this method in the multi-context inductive theorem prover of Sato and Kurihara to overcome the strategic problems resulting from the unsoundness of the method. The experimental results show that our method is effective especially for some problems diverging with complex differences (i.e., parallel and nested differences).
引用
收藏
页码:223 / 238
页数:16
相关论文
共 33 条
[1]  
Aoto T., 2007, JSSST 24 ANN C
[2]  
Aoto T., 2008, P 1 SCSS, V08-08, P1
[3]  
Aoto T, 2006, LECT NOTES COMPUT SC, V4098, P242
[4]   Termination of term rewriting using dependency pairs [J].
Arts, T ;
Giesl, J .
THEORETICAL COMPUTER SCIENCE, 2000, 236 (1-2) :133-178
[5]  
Baader F., 1998, TERM REWRITING ALL
[6]  
BASIN D, 1992, LECT NOTES ARTIF INT, V607, P295
[7]  
Basin D. A., 1994, Automated Deduction - CADE-12. 12th International Conference on Automated Deduction. Proceedings, P466
[8]  
BASIN DA, 1993, IJCAI-93, VOLS 1 AND 2, P116
[9]  
Boyer R.S., 1979, A Computational Logic
[10]   RIPPLING - A HEURISTIC FOR GUIDING INDUCTIVE PROOFS [J].
BUNDY, A ;
STEVENS, A ;
VANHARMELEN, F ;
IRELAND, A ;
SMAILL, A .
ARTIFICIAL INTELLIGENCE, 1993, 62 (02) :185-253