| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Kool, Dr. M. | |
| dc.contributor.author | Silfhout, R.J.M. | |
| dc.date.accessioned | 2021-09-06T18:00:14Z | |
| dc.date.available | 2021-09-06T18:00:14Z | |
| dc.date.issued | 2019 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/778 | |
| dc.description.abstract | Automated Geometry Theorem Proving (AGTP) is an algebraic approach to (dis)proving geometric statements in such a way that it can be (mostly) fully automated. The main idea is to translate the given geometric properties to polynomials, where the variables are the coordinates of the given points, and look at the corresponding variety. One way (a first approach) to see if a certain property holds, is to see if its corresponding polynomial is contained in the vanishing ideal of the initial variety. A more complete approach is Wu's Method, which relies on the theorem behind ascending chains and pseudo-remainders.
To try out how far we can automate this approach, I have implemented the concept of AGTP in Python. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 844283 | |
| dc.format.extent | 4418 | |
| dc.format.extent | 271734 | |
| dc.format.extent | 2265 | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | text/plain | |
| dc.format.mimetype | text/x-python | |
| dc.format.mimetype | text/x-tex | |
| dc.language.iso | en | |
| dc.title | Automated Geometry Theorem Proving | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | automated, geometry, theorem, proving, Python, Sympy | |
| dc.subject.courseuu | Mathematical Sciences | |
