Metz, Daniëlle (2018) A Sound and Complete Non-Branching Temporal Linear-Time Logic Solver with the Extendability Constraint. Bachelor's Thesis, Artificial Intelligence.
|
Text
bAI_2018_MetzDM.pdf.pdf Download (203kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf Restricted to Registered users only Download (93kB) |
Abstract
In this research, a non-branching temporal linear-time logic solver was implemented with the extendability constraint. The logic was tested on its soundness and completeness. The solver was tested on how fast it could solve 6 temporal linear-time logic problems with or without allowing infinite branching. Half of the problems required extendability to get further down the tableau. The results show that these problems require significantly more time to solve the problem a thousand times with the allowance of infinite branches compared to the standard solver. There was also one problem that did not require extendability that still showed significant results. This could have been caused by an extra if-evaluation or the great variation in run-time in general.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Verbrugge, L.C. |
| Degree programme: | Artificial Intelligence |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 28 Aug 2018 |
| Last Modified: | 04 Sep 2018 14:24 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/18415 |
Actions (login required)
 |
View Item |