Duration:
1 Semester | Turnus of offer:
each summer semester | Credit points:
4 |
Course of studies, specific field and terms: - Bachelor IT-Security 2016 (optional subject), specific, Arbitrary semester
- Bachelor Computer Science 2016 (optional subject), major subject informatics, Arbitrary semester
- Bachelor Computer Science 2014 (optional subject), major subject informatics, Arbitrary semester
- Bachelor Computer Science 2019 (optional subject), major subject informatics, Arbitrary semester
- Bachelor Computer Science 2019 (compulsory), Canonical Specialization Web and Data Science, 4th semester
|
Classes and lectures: - Logic Programming (exercise, 1 SWS)
- Logic Programming (lecture, 2 SWS)
| Workload: - 55 Hours private studies
- 45 Hours in-classroom work
- 20 Hours exam preparation
| |
Contents of teaching: | - Logical foundations: First-order logic (syntax, semantics, resolution, ...), Datalog (syntax, semantics, evaluation strategies, magic-sets)
- Logic programming in Prolog: syntax, semantics, recursive data structures, difference lists, DCGs, Application: natural language processing (NLP)
- Answer Set Programming (ASP): syntax, semantics (sable models), applications
- Constraint programming: Theoretical foundations, Constraint Programming in Prolog and ASP
- Outlook: Probabilistic Logic programming, Prolog and ASP for Data Science: Generating relational annotations: Relational learning
| |
Qualification-goals/Competencies: - For each of the mentioned themes in the contents of teaching the students are able to explain the central ideas, are able to define the relevant concepts and are able to explain how the learned algorithms work in concrete application scenarios.
|
Grading through: - Written or oral exam as announced by the examiner
|
Requires: |
Responsible for this module: Teachers: |
Literature: - Bratko: Prolog programming for artificial intelligence - Addison Wesley, 2011
- Clocksin, Mellish: Programming in Prolog - Springer, 2003
- Baral: Knowledge representation reasoning and declarative problem solving - CUP, 2003
- Gebser, Kaminski, Kaufmann, Schaub: Answer Set Solving in Practice - Morgan/Claypool Publishers, 2012
- Apt: Principles of constraint programming - Cambridge, 2003
- De Raedt: Logical relational learning - Springer, 2008
|
Language: |
Notes:Prerequisites for attending the module: - None Prerequisites for the exam: - Successful completion of homework assignments during the semester. |
Letzte Änderung: 15.2.2024 |
für die Ukraine