SoSe22: Constraint-based Semantics 2
Meeting 02: Introduction
Note: The meeting takes place asynchronically!
Definition of a model
The following material is an adapted form of material created by student participants of the project e-Learning Resources for Semantics (e-LRS). Involved participants: Lisa, Marthe, Elisabeth, Isabelle.
Watch a short podcast what first-order models look like.
Based on this podcast, we can define a model as follows:
- Universe: U = {LittleRedRidingHood, Grandmother, Wolf}
- Properties:
red-hood = { < x> | x wears a read hood } = { <LittleRedRidingHood> }
female = { <x> | x is female } = { <LittleRedRidingHood>, <Grandmother> }
big-mouth = { <x> | x has a big mouth } = { <Wolf> }
live-in-forest = { < x> | x lives in the forest } = { <Grandmother>, <Wolf>} - Relations:
grand-child-of = { <x,y> | x is y 's grandchild } = { <LittleRedRidingHood,Grandmother > }
afternoon-snack-of = { <x,y> | x is y 's afternoon snack } = { <LittleRedRidingHood,Wolf > }
Computation of the truth value of atomic formulae
The following video presents the step-by-step computation of the truth value of two atomic formulae. The example uses a model based on Shakespeare's play Macbeth. The two formulae are:
- kill(macbeth,duncan)
- kill(lady-macbeth,macbet)
Computation of the truth value of complex formulae
The following video presents the step-by-step computation of the truth value of two formulae with connectives. The example uses a model based on Shakespeare's play Macbeth. The two formulae are:
- ¬ king(lady-macbeth)
- king(duncan) ∨ king(lady-macbeth)
The next video shows how the truth value of a more complex formula can be computed. The example contains two connectives:
kill(malcom,lady-macbeth) ∨ ¬thane(macbeth)
The video shows two different methods: top down and bottom up.
Quantifiers
Video introducing determiners into our logical language. (The video is based on the scenario of Romeo and Juliett.)
Meeting 01
(no meeting)