Solving legal cases with and without modal logic

dc.contributor.advisorHubbers, E.M.G.M.
dc.contributor.advisorWiedijk, F.
dc.contributor.authorBennink, Bibian
dc.date.issued2020-07-10
dc.description.abstractThe research presented in this thesis elaborates on whether modal logic has an advantage over models without modal logic in constructing models for legal cases. There are several kinds of logics that could be used to construct such a model. Within this thesis for the model with modal logic: Standard Deontic Logic (SDL) together with Propositional Deontic Logic (PDeL) is used. For the model without modal logic: a reduction graph representation is used. This thesis starts off with theoretical background on both SDL and PDeL, and the reduction graph representation, where the background for the models used in this thesis is given. Secondly, the models are constructed for two legal cases, the Bourhill v Young case and HI's case. Finally, a comparison is made between the logical models to conclude whether, in the cases used in this thesis, deontic logic is an advantage. From the comparison it can be concluded that, for the cases used in this thesis, using deontic logic is not necessarily an advantage over using the reduction graph representation. This is due to the fact that deontic logic is relatively complex and does not yet deal well with cases that need a subjective approach.en_US
dc.identifier.urihttps://theses.ubn.ru.nl/handle/123456789/12758
dc.language.isoenen_US
dc.thesis.facultyFaculteit der Sociale Wetenschappenen_US
dc.thesis.specialisationBachelor Artificial Intelligenceen_US
dc.thesis.studyprogrammeArtificial Intelligenceen_US
dc.thesis.typeBacheloren_US
dc.titleSolving legal cases with and without modal logicen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Bennink, 1002645.pdf
Size:
1.68 MB
Format:
Adobe Portable Document Format