|
Courses and Workshops
|
| Title: | Computational semantics |
| Lecturer(s): | Alexander Koller (Saarland University), Aljoscha Burchardt (Saarland
University) and Stephan Walter (Saarland University) |
| Type: | Introductory Course |
| Section: | Logic and Language |
| Week: | Second | | Time: | 17.00-18.30 (Slot 4) |
| Webpage: | http://www.coli.uni-sb.de/cl/projects/milca/courses/comsem/
|
| Reader: | Download | | Room: | A1 |
Description The most central fact about natural language is that it has meaning.
Semantics is the study of meaning. In formal semantics, we conduct this
study in a formal manner. In computational semantics, we're
additionally interested in using the results of our study when we
implement programs that process natural language.
In this course, we show how formal semantic representations can be
computed and used in simple inference systems. We discuss the following
topics:
* Lambda calculus
* Montague-style semantics construction
* Scope underspecification with dominance constraints
* Tableau systems for propositional inference
Each theoretical topic in the lecture is made more concrete by a
discussion of a Prolog implementation.
We assume only basic knowledge of Prolog (as taught e.g. in
Striegnitz' Prolog course in the first week), and some familiarity
with first-order predicate logic.
This course is endorsed by SIGSEM, the ACL' Special Interest Group in
Computational Semantics.
|
© 2003, 2004 LORIA, Carlos Areces. |
2004-07-07
| |
