FI:IA165 Combinatory Logic - Course Information
IA165 Combinatory Logic for Computational SemanticsFaculty of Informatics
- Extent and Intensity
- 2/0/0. 2 credit(s) (plus extra credits for completion). Type of Completion: k (colloquium).
- Juyeon Kang, PhD. (lecturer), doc. Mgr. Pavel Rychlý, Ph.D. (deputy)
RNDr. Vojtěch Kovář, Ph.D. (seminar tutor)
RNDr. Miloš Jakubíček, Ph.D. (seminar tutor)
- Guaranteed by
- prof. Ing. Václav Přenosil, CSc.
Department of Machine Learning and Data Processing - Faculty of Informatics
Supplier department: Department of Machine Learning and Data Processing - Faculty of Informatics
- Fri 12:00–13:50 B410
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- Fields of study the course is directly associated with
- Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
- Course objectives
- This course aims at introducing the Combinatory Logic and its application to computational semantics. We will mainly describe how the Combinatory Logic can be useful for semantic analysis of natural language from the computational point of view. Students in this course will have an opportunity to become familiar with a practical technique of computation semantics, learn to construct semantic representations of natural language and discover the properties of natural language most relevant to logical reasoning.
- A. Introduction to Combinatory Logic (CL): historical overview on CL, CL as an applicative system, abstract operators called combinators, normal form, β-reductions and definitions, equivalence to A. Church's λ-expressions, Curry-Howard isomorphism. B. Combinatory Logic as a tool for computational semantics: background on computational semantics, semantic representations of natural language; passivisation, quantifiers and scope, reflexivisation, aspectual and temporal relations, long-distance dependencies (non-local), cross-serial dependencies, semantic parsers; Boxer, Grail,....
- recommended literature
- HINDLEY, J. Roger and J. P. SELDIN. Lambda-calculus and combinators, an introduction. : Cambridge University Press, 2008. info
- Teaching methods
- lectures, classwork
- Assessment methods
- final written test
- Language of instruction
- Further Comments
- Study Materials
The course is taught only once.
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2012/IA165