Find Closed Form Solutions to Recurrences Using Theorem Discovery

MPhil Thesis Defence


Title: "Find Closed Form Solutions to Recurrences Using Theorem Discovery"

By

Mr. Jianwei WANG


Abstract

Recent years, program verification has become a more and more key problem 
in computer science. Solving recurrences, as a vital part of program 
verification system, has also attracted much more interests from outside. 
Although there exist some well-known systems like Sympy and Mathematica 
which help computing closed-form solutions for recurrences, these tools 
have limited functions and sometimes don't work. Especially, those 
existing systems in literature have no ability of finding solutions to 
recurrences with conditions. In this thesis, a system of finding closed 
form solutions to recurrences using machine theorem discovery is 
presented. Our proposed method can successfully address not only lots of 
"common" recurrences(without conditions), but also multiple kinds of 
conditional recurrences(with single condition) and nested conditional 
recurrences(with more than one conditions), demonstrated by a systematic 
experimental evaluation.


Date:			Friday, 3 May 2019

Time:			9:30am - 11:30am

Venue:			Room 4472
 			Lifts 25/26

Committee Members:	Prof. Fangzhen Lin (Supervisor)
 			Dr. Raymond Wong (Chairperson)
 			Dr. Ke Yi


**** ALL are Welcome ****