dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Winter, Y. | |
dc.contributor.author | Kruit, B.B. | |
dc.date.accessioned | 2013-09-27T17:00:46Z | |
dc.date.available | 2013-09-27 | |
dc.date.available | 2013-09-27T17:00:46Z | |
dc.date.issued | 2013 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/15033 | |
dc.description.abstract | To allow proofs of textual entailments in the model described by Toledo et al. using a first-order automated theorem prover, we need to rewrite higher-order expressions to first-order logic. This thesis describes a rewriting algorithm that captures a certain class of natural language inferences corresponding to modifiers. It is sound, but not complete. | |
dc.description.sponsorship | Utrecht University | |
dc.language.iso | en_US | |
dc.title | Using a first-order theorem prover in the SemAnTE framework | |
dc.type.content | Bachelor Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.courseuu | Kunstmatige Intelligentie | |