Disclaimer: Dieser Thread wurde aus dem alten Forum importiert. Daher werden eventuell nicht alle Formatierungen richtig angezeigt. Der ursprüngliche Thread beginnt im zweiten Post dieses Threads.
Assignment 4
Dear all,
we have one new homework assignment for you: Create a GLIF implementation for translating sentences to expressions in modal logic.
Here are a few examples:
parse "Berta is not allowed to jump" | construct
¬◇(jump berta)
parse "Berta sees John and Mary" | construct
(see berta john)∧(see berta mary)
parse "John and Mary have to run" | construct
□((run john)∧(run mary))
parse "John and Mary do not have to see Berta and Peter" | construct
¬□(((see john berta)∧(see john peter))∧((see mary berta)∧(see mary peter)))
I won’t give you a skeleton implementation for this problem - please ask if you encounter any difficulties.
Tip: For noun phrases, you should again use the type (ι ⟶ o) ⟶ o because you can’t represent John and Mary with type ι.
Tip: You don’t have to make it that general. For example, you don’t have to support sentences like John has to be allowed to run.
Dear all,
just as a reminder - today we’ve decided on a deadline for this assignment: Feb 9 (so that we can discuss it in that lecture).