Proof output and machine learning for inductive theorem provers

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/238593
Download file(s):
File Description SizeFormat 
238593.pdfFulltext545.26 kBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLindhé, Victor
dc.contributor.authorLogren, Niklas
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T13:55:47Z-
dc.date.available2019-07-03T13:55:47Z-
dc.date.issued2016
dc.identifier.urihttps://hdl.handle.net/20.500.12380/238593-
dc.description.abstractAutomatic theorem provers have lately seen significant performance improvements by utilising knowledge from previously proven theorems using machine learning. HipSpec is an inductive theorem prover that has not yet explored this area, which is the primary motivation for this work. We lay a foundation for supporting machine learning implementations within HipSpec. Firstly, a format for representing inductive proofs of theorems is designed. Secondly, a persistent library is implemented, which allows HipSpec to remember already-proven theorems in between executions. These extensions are vital for allowing machine learning, since they provide the machine learning algorithms with the necessary data. This foundation is used to perform machine learning experiments on theorems from the TIP library, which is a collection of benchmarks for inductive theorem provers. We define several different feature extraction schemes for theorems, and test these using both supervised learning and unsupervised learning algorithms. The results show that although no correlation between induction variables and term structure can be found, it is possible to utilise clustering algorithms in order to identify some theorems about tail-recursive functions.
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectInformations- och kommunikationsteknik
dc.subjectData- och informationsvetenskap
dc.subjectInformation & Communication Technology
dc.subjectComputer and Information Science
dc.titleProof output and machine learning for inductive theorem provers
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.