Module details

M1101-CMS74  Advanced Logical Modeling

Module Owner: N.N.
Displayed in timetable as: CMS-LM-ADV
Duration: 3
Number of electives: 0
Credits: 10,0
Start Semester: SuSe 2021
Lecturer Responsible Prof. Dr. Markus Krötzsch
markus.kroetzsch@tu-dresden.de
Qualification Goals Students have in-depth and specialised knowledge in the field of Logical Modelling, which in particular extends the skills acquired in the modules „Models of Computation“ and „Artificial Intelligence” and includes additional qualifications from these areas. They are able to select suitable solution methods for new tasks from these areas and to further develop existing methods.
Content The module covers in-depth content from specialised fields of research and application, which includes additional advanced content from the CMS-LM-MOC and CMS-LM-AI modules. The content includes specialised and advanced content dealing with topics mentioned in the module descriptions of the CMS-LM-MOC and CMS-LM-AI modules. The content offered will enable students to deepen one or more key topics of these extensive areas.
Forms of Teaching and Learning The module includes a lecture, a practical, a seminar, tutorials, an internship, and project work amounting to 8 hours per week plus independent study. Courses are to be selected from the CMS-LM-ADV catalogue to the extent indicated; this catalogue, including the language of the course, the required graded work and the weighting of the grades, will be announced at the beginning of the semester as is customary at the Faculty of Computer Science.
Prerequisites for Participation No previous specialist knowledge is required.
Applicability Besides CMS-LM-TEA, this module is one of two elective modules for students of the track Logical Modelling in the second semester of the Master degree programme Computational Modelling and Simulation.
Prerequisites for the Assignment of Credit Points The credit points are awarded if the module examination is passed. The module examination consists of the graded work specified in the CMS-LM-ADV catalogue.
Credit Points and Grades 10 credit points can be earned by completing this modules. The module grade results from the weighted average of the grades of the graded work according to the CMS-LM-ADV catalogue.
Frequency of Offer The module is offered in each summer semester.
Workload The total workload is 300 hours.
Duration of Module The module takes one semester to complete.
Module Number Module Handbook TU Dresden CMS-LM-ADV

Registration periods

Phase Block Register from | to End cancellation
Ohne Auswahlverfahren Vorlesungszeit 04.04.2021 00:00 | 15.06.2021 00:00 13.07.2021 00:00

Courses
Number Name Semester  
DK1100-MA002X Dummykurs CMS 2 SWS  
DK1100-MA004X Dummykurs CMS 4 SWS  
DK1100-MA012X Dummykurs CMS 2 SWS  
DK1100-MA012X Computer Vision Seminar (S) SuSe 2021
DK1100-MA014X Dummykurs CMS 4 SWS  
DK1100-MA016X Dummykurs 6 SWS  
DK1100-MA018X Dummykurs CMS 8 SWS  
DK1100-MA022X Dummykurs CMS 2 SWS  
DK1100-MA024X Dummykurs 4 SWS  
DK1100-MA034X Dummykurs 4 SWS  
K1101-MA0001V Fuzzy Description Logic (L)  
K1101-MA0001V Fuzzy Description Logic (L) WiSe 2021/22
K1101-MA0001Ü Fuzzy Description Logic (E)  
K1101-MA0001Ü Fuzzy Description Logic (E) WiSe 2021/22
K1101-MA0002V Advanced Logics (L)  
K1101-MA0002V Advanced Logics (L) SuSe 2021
K1101-MA0002V Advanced Logics (L) SuSe 2022
K1101-MA0002Ü Advanced Logics (E)  
K1101-MA0002Ü Advanced Logics (E) SuSe 2021
K1101-MA0002Ü Advanced Logics (E) SuSe 2022
K1101-MA0003V Automata and Logic (L)  
K1101-MA0003Ü Automata and Logic (E)  
K1101-MA0007S Rule-Based Paradigms in Knowledge Representation (S)  
K1101-MA0008V Concurrency Theory (L)  
K1101-MA0008V Concurrency Theory (L) SuSe 2022
K1101-MA0008Ü Concurrency Theory (Ü)  
K1101-MA0008Ü Concurrency Theory (E) SuSe 2022
K1101-MA0013S Seminar Theoretical Computer Science (S)  
K1101-MA0014V Introduction to Non-monotonic Reasoning (V)  
K1101-MA0014Ü Introduction to Non-monotonic Reasoning (E)  
K1101-MA0015V Introduction to Automatic Structures (L)  
K1101-MA0015Ü Introduction to Automatic Structures (E)  
K1101-MA0016V Description Logic (L)  
K1101-MA0016V Description Logic (L) SuSe 2021
K1101-MA0016V Description Logic (L) SuSe 2022
K1101-MA0016Ü Description Logic (E)  
K1101-MA0016Ü Description Logic (E) SuSe 2021
K1101-MA0016Ü Description Logic (E) SuSe 2022
K1101-MA0018V Logic Based Ontology Engineering (L)  
K1101-MA0018V Logic Based Ontology Engineering (L) SuSe 2021
K1101-MA0018V Logic Based Ontology Engineering (L) SuSe 2022
K1101-MA0018Ü Logic Based Ontology Engineering (E)  
K1101-MA0018Ü Logic Based Ontology Engineering (E) SuSe 2021
K1101-MA0018Ü Logic Based Ontology Engineering (E) SuSe 2022
K1101-MA0019V Model Checking (L)  
K1101-MA0019Ü Model Checking (E)  
K1101-MA0020Ü Lab Course Modeling and Automated Verification (E)  
K1101-MA0021S Seminar Selected Topics in Logic and Verification (S)  
K1101-MA0021V Foundations of Complexity Theory (L)  
K1101-MA0022V Complexity Theory (V)  
K1101-MA0022Ü Complexity Theory (E)  
K1101-MA0025V Term Rewriting Systems (L)  
K1101-MA0025Ü Term Rewriting Systems (E)  
K1101-MA0030S Seminar Data Aware Processes (S)  
K1101-MA0030S Seminar Data-Aware Processes (S) SuSe 2021
K1107-M0070V Human Reasoning and the Weak Completion Semantics 2 (L)  
K1107-M0070Ü Human Reasoning and the Weak Completion Semantics 2 (E)  
K1107-MA0004S Seminar Knowledge Representation and Reasoning (S)  
K1107-MA0004S Seminar Knowledge Representation and Reasoning (S) SuSe 2022
K1107-MA0011V Linear Programming (L)  
K1107-MA0011Ü Linear Programming (E)  
K1107-MA0012V Human Reasoning and the Weak Completion Semantics 1 (L)  
K1107-MA0012Ü Human Reasoning and the Weak Completion Semantics 1 (E)  
K1107-MA0013V Formal Argumentation and Artifical Intelligence (L)  
K1107-MA0013V Formal Argumentation for Artifical Intelligence (L) WiSe 2021/22
K1107-MA0013Ü Formal Argumentation and Artifical Intelligence (E)  
K1107-MA0013Ü Formal Argumentation and Artifical Intelligence (E) WiSe 2021/22
K1107-MA0018V Database Theory (L)  
K1107-MA0018Ü Database Theory (E)  
K1107-MA0019V Finite and Algorithmic Model Theory (L)  
K1107-MA0019Ü Finite and Algorithmic Model Theory (E)  
K1107-MA0022V Integer Programming (L)  
K1107-MA0022Ü Integer Programming (E)  
K1107-MA0055V Introduction to Formal Concept Analysis (L)  
K1107-MA0055Ü Introduction to Formal Concept Analysis (E)  

Passing rules
Context Name Description
Global * For information on the module examination please see module description
Global *

Requirements
Course / Final module requirements Requirements Compulsory pass Weighting
DK1100-MA002X Dummykurs CMS 2 SWS Assessment No 2
DK1100-MA004X Dummykurs CMS 4 SWS Assessment No 4
DK1100-MA012X Dummykurs CMS 2 SWS Assessment No 2
DK1100-MA014X Dummykurs CMS 4 SWS Assessment No 4
DK1100-MA016X Dummykurs 6 SWS Assessment No 6
DK1100-MA018X Dummykurs 8 SWS Assessment No 8
DK1100-MA022X Dummykurs CMS 2 SWS Assessment No 2
DK1100-MA024X Dummykurs 4 SWS Assessment No 4
DK1100-MA034X Dummykurs 4 SWS Assessment No 4
K1101-MA0001V Fuzzy Description Logic (L) Oral Assessment Fuzzy Description Logic No 4
K1101-MA0002V Advanced Logics (L) Oral Assessment Advanced Logics No 6
K1101-MA0003V Automata and Logic (L) Oral Assessment Automata and Logic No 6
K1101-MA0007S Rule-Based Paradigms in Knowledge Representation (S) Seminar Paper Rule-Based Paradigms in Knowledge Representation No 1
Oral Presentation No 1
K1101-MA0008V Concurrency Theory (L) Assessment No 4
K1101-MA0013S Seminar Theoretical Computer Science (S) Seminar Paper Theoretical Computer Science No 1
Presentation Theoretical Computer Science No 1
K1101-MA0014V Introduction to Non Monotonic Reasoning (L) Oral Assessment Introduction to Non-monotonic Reasoning No 4
K1101-MA0015V Introduction to Automatic Structures (L) Oral Assessment Introduction to Automatic Structures No 4
K1101-MA0016V Description Logic (L) Oral Assessment Description Logic No 6
K1101-MA0018V Logic based Ontology Engineering (L) Oral Assessment Logic Based Ontology Engineering No 4
K1101-MA0019V Model Checking (L) Oral Assessment Model Checking No 8
K1101-MA0020Ü Lab Course Modeling and Automated Verification (E) Project Report Modeling and Automated Verification No 2
K1101-MA0021S Seminar Selected Topics in Logic and Verification (S) Seminar Paper Selected Topics in Logic and Verification No 1
Presentation Selected Topics in Logic and Verification No 1
K1101-MA0021V Foundations of Complexity Theory (L) Oral Assessment Foundations of Complexity Theory No 4
K1101-MA0022V Complexity Theory (L) Oral Assessment Complexity Theory No 6
K1101-MA0025V Term Rewriting Systems (L) Oral Assessment Term Rewriting Systems No 6
K1101-MA0030S Seminar Data-Aware Processes (S) Presentation Data Aware Processes No 1
Seminar Paper Data Aware Processes No 1
K1107-M0070V Human Reasoning and the Weak Completion Semantics 2 (L) Oral Assessment Human Reasoning and the Weak Completion Semantics 2 No 6
K1107-MA0004S Seminar Knowledge Representation and Reasoning (S) Presentation Knowledge Representation and Reasoning No 2
K1107-MA0011V Linear Programming (L) Oral Assessment Linear Programming No 4
K1107-MA0012V Human Reasoning and the Weak Completion Semantics 1 (L) Oral Assessment Human Reasoning and the Weak Completion Semantics 1 No 6
K1107-MA0013V Formal Argumentation and Artifical Intelligence (L) Oral Assessment Formal Argumentation for Artifical Intelligence No 4
K1107-MA0018V Database Theory (L) Oral Assessment Database Theory No 6
K1107-MA0019V Finite and Algorithmic Model Theory (L) Oral Assessment Finite and Algorithmic Model Theory No 4
K1107-MA0022V Integer Programming (L) Written Examination Integer Programming No 4
K1107-MA0055V Introduction to Formal Concept Analysis (L) Oral Assessment Introduction to Formal Concept Analysis No 4

Caption
**

For this final module requirement, several combinations of requirements do exist. The passing rules (see above) specify, whether you have to complete one or several requirement combinations.