Superposition with Structural Induction

被引:36
作者
Cruanes, Simon [1 ]
机构
[1] Univ Lorraine, CNRS, INRIA, LORIA, F-54000 Nancy, France
来源
FRONTIERS OF COMBINING SYSTEMS (FROCOS 2017) | 2017年 / 10483卷
关键词
SYSTEM;
D O I
10.1007/978-3-319-66167-4_10
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Superposition-based provers have been successfully used to discharge proof obligations stemming from proof assistants. However, many such obligations require induction to be proved. We present a new extension of typed superposition that can perform structural induction. Several inductive goals can be attempted within a single saturation loop, by leveraging AVATAR [1]. Lemmas obtained by generalization or theory exploration can be introduced during search, used, and proved, all in the same search space. We describe an implementation and present some promising results.
引用
收藏
页码:172 / 188
页数:17
相关论文
共 38 条
[1]  
[Anonymous], 2007, Journal on Satisfiability, Boolean Modeling and Computation
[2]  
Aubin R, 1977, IJCAI
[3]  
BACHMAIR L, 1990, LECT NOTES ARTIF INT, V449, P427
[4]  
Barrett C., 2016, The Satisfiability Modulo Theories Library (SMT-LIB)
[5]  
Baumgartner Peter, 2013, Automated Deduction - CADE-24. 24th International Conference on Automated Deduction. Proceedings: LNCS 7898, P39, DOI 10.1007/978-3-642-38574-2_3
[6]  
BEESON M, 2004, P WORKSH EMP SUCC 1
[7]  
BIUNDO S, 1986, LECT NOTES COMPUT SC, V230, P672
[8]  
Boyer RobertS., 2014, COMPUTATIONAL LOGIC
[9]   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
[10]  
Burel G, 2010, LECT NOTES COMPUT SC, V6247, P155, DOI 10.1007/978-3-642-15205-4_15