Ralf Klabunde, University of Bochum
This courses offers an introduction to Computational Semantics on an intermediate level. After a brief introduction to first-order logic and its
relevance for the computational treatment of semantic issues, we will get to know the lambda calculus for the construction of semantic representations, as well as different approaches to the construction of underspecified representations. If we should have some time for further topics, we will also have a brief look at inference methods for first-order logic.
Prerequisites: basic knowledge of semantics; in particular the principle of compositionality shouldn't be a foreign word for you. Knowledge of the programming language PROLOG ("programing in logic") is advantageous, but not necessary.
The excellent textbook by Patrick Blackburn & Johan Bos (2005) Representation and Inference for Natural Language. A First Course in Computational Semantics. Stanford: CSLI Publications. will be taken as the basis of this course.
Level: intermediate
Slides for students