Nankman, Olaf (2025) Optimised resolution-based theorem proving using a heuristic-based search algorithm. Bachelor's Thesis, Computing Science.
|
Text
main.pdf Download (706kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
Toestemming.pdf Restricted to Registered users only Download (180kB) |
Abstract
Automated theorem proving is a foundational area of research in computer science and, in particular, in artificial intelligence. Resolution, a refutation-complete inference technique, plays a central role in many first-order logic proving frameworks, such as Prolog. However, the search space in first-order logic is vast and often infinite, which often renders naive resolution strategies inefficient in practice. This thesis investigates the application of a heuristic-guided search algorithm in resolution-based theorem proving. By integrating heuristics with classical resolution, the work aims to improve the efficiency of proof search in large or complicated knowledge-bases.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Meijster, A. and Top, J. |
| Degree programme: | Computing Science |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 18 Jul 2025 06:21 |
| Last Modified: | 18 Jul 2025 06:21 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/36372 |
Actions (login required)
 |
View Item |