Account
Edit tools
Intern
SucheSearch
English

Suche mittels Attribut

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.

Suche mittels Attribut

Eine Liste aller Seiten, die das Attribut „Beschreibung“ mit dem Wert „http://lat.inf.tu-dresden.de/teaching/ws2014-2015/DL/“ haben. Weil nur wenige Ergebnisse gefunden wurden, werden auch ähnliche Werte aufgelistet.

Hier sind 26 Ergebnisse, beginnend mit Nummer 1.

Zeige (vorherige 50 | nächste 50) (20 | 50 | 100 | 250 | 500)

    

Liste der Ergebnisse

  • Team Project “Model Checking”  + (This course offers advanced topics in the … This course offers advanced topics in the field of formal modeling and analysis. It is meant for students enrolled in the Master's program “Computational Modeling and Simulation”. The tasks are usually taken from our current projects and cover programming and theoretical problems as well. Within this research-relevant project, students are working in teams of about 2 to 4 people to solve a complex interdisciplinary task that includes different areas of logical modeling and model checking.</br></br>===Prerequisites===</br></br>* Profound knowledge in model checking, acquired in the lecture “Model Checking” or similar courses at other universities</br>* Solid foundations in algorithms and data structures, in automata theory and formal languages as well as in complexity theory</br>* Basic mathematical foundations</br>* Programming skills in Java or C/C++ are beneficial, unless you are interested in a purely theoretical topice interested in a purely theoretical topic)
  • Behind the secrets of large language models  + (This course provides a practical and in-de … This course provides a practical and in-depth understanding of large language models that power modern natural language processing systems. Students will explore the architecture, training methodologies, capabilities, and ethical implications of LLMs. The course combines theoretical knowledge with hands-on experience to equip students with the skills necessary to develop, analyze, and apply LLMs in various contexts.</br></br>https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/46076788747?5de/opal/auth/RepositoryEntry/46076788747?5)
  • Logic  + (This course will introduce you to proposit … This course will introduce you to propositional logic and first-order predicate logic. After reviewing syntax and semantics, we will cover some basic concepts like normal forms, substitution, and unification. You will be introduced to proof procedures such as the resolution calculus and related concepts including soundness, completeness, and decidability.</br></br>===Schedule ===</br></br>* the lecture and the tutorial will take place in room E05</br>* the lecture will take place on Monday, 4.DS (13:00 - 14:30, starting on 9.10.2017) and on Thursday, 4.DS (13:00 - 14:30)</br>* the tutorial will take place on Tuesday, 2.DS (9:20 - 10:50, starting on 17.10.2017) and on Friday, 6.DS (16:40 - 18:10)</br>* The next tutorial on Friday, 10.11., will be moved to Wednesday 8.11. 2.DS (9:20 - 10:50).</br>* the exam will be on Saturday, 9.12.2017 at 9:20. The location will be at [https://navigator.tu-dresden.de/raum/136103.0040 HSZ/304/Z]</br></br>===Lecture Slides===</br></br>* The slides from the EMCL welcome session can be found [https://iccl.inf.tu-dresden.de/w/images/4/4d/Emclwelcome2017.pdf here].</br></br></br>The lecture slides can be found [http://www.wv.inf.tu-dresden.de/materials/logic/ here] (updated on 28.11.2017). The user name is ''student'' and the password will be given during the lecture.</br></br>===Exercises===</br></br>During the tutorial we will only discuss your solutions to the exercises. That means that you are supposed to solve the exercises by yourself beforehand.</br></br>* [https://iccl.inf.tu-dresden.de/w/images/4/40/Logic1.pdf Exercise 1] (17.10.17)</br></br>During the next tutorials, the exercises in the exercise book will be discussed. Please pay attention to our [https://iccl.inf.tu-dresden.de/w/images/4/40/CL-PS-Guidelines-2014.pdf guidelines]./40/CL-PS-Guidelines-2014.pdf guidelines].)
  • Logic  + (This course will introduce you to proposit … This course will introduce you to propositional logic and first-order predicate logic. After reviewing syntax and semantics, we will cover some basic concepts like normal forms, substitution, and unification. You will be introduced to proof procedures such as the resolution calculus and related concepts including soundness, completeness, and decidability.</br></br>'''News'''</br>* '''The tutorial on Thursday, 1st December is canceled. Instead, we will have an additional tutorial on Monday, 5th December, 9:20 in room E05'''</br>* '''The successor course [[Science_of_Computational_Logic_(WS2016)|Science of Computational Logic]] starts on 5th December.'''</br>* The date for the final exam is Tuesday, 13th December, 14:50 -- 16:20 in room E05.</br>* There will be an additional tutorial on Monday, 21th November, 9:20 in room E05.</br>* The tutorial on Tuesday, 15th November is canceled.</br></br></br>'''Lecture and Teaching Material'''</br></br>The tutorial starts Thursday, 13. October.</br></br>'''Slides'''</br></br>[[Datei:ws16-logic-history.pdf|History]]</br>[[Datei:ws16-logic-propositional.pdf|Propositional Logic]]</br>[[Datei:Fol2015-update2.pdf|Predicate Logic]]</br></br>'''Exercise sheets'''</br></br>[[:Datei:Sheet-1.pdf|Exercise sheet 1]]</br></br>'''Exercise Book'''</br></br>Please pay attention to our [https://iccl.inf.tu-dresden.de/web/Datei:CL-PS-Guidelines-2014.pdf guidelines].</br></br></br></br></br>'''Test Exam'''</br></br>We plan to run one test exam on Tuesday, 22th November</br></br>'''Written Exam'''</br></br>This course will be examined as a part of the Foundations exam.</br>The Foundation exam consists of two separate exams:</br>a written examination for the course Logic and an oral examination for the course</br>[https://iccl.inf.tu-dresden.de/web/Science_of_Computational_Logic_(WS2015) Science of Computational Logic].</br>The written exam is scheduled shortly before Christmas</br></br>'''Some remarks on the style of the written exam in logic'''</br>* no exam aids or support materials will be allowed. In other words, only writing materials are allowed.</br>* The emphasis of the exam will be on the proofs of theorems, propositions and lemmata from the lectures and the proofs occurring with the problems from the tutorials.</br>* In addition, in the first problem of the exam we will usually ask for some definition or algorithm presented on the lectures, e.g. define concepts like substitution, resolvent, interpretation, Skolemization, ... or algorithms like unification, transformation to clause form, ...</br>* Maybe, one or two exam problems will be the application of some of the presented calculi (e.g. resolution, natural deduction, normalform transformation, etc).eduction, normalform transformation, etc).)
  • Logic  + (This course will introduce you to proposit … This course will introduce you to propositional logic and first-order predicate logic. After reviewing syntax and semantics, we will cover some basic concepts like normal forms, substitution, and unification. You will be introduced to proof procedures such as the resolution calculus and related concepts including soundness, completeness, and decidability.</br></br>The lecture ends on November 25, and we continue with [https://iccl.inf.tu-dresden.de/web/Science_of_Computational_Logic_(WS2015)/en Science of Computational Logic]</br></br>'''Exercise Book'''</br></br>Please pay attention to our [https://iccl.inf.tu-dresden.de/web/Datei:CL-PS-Guidelines-2014.pdf guidelines].</br></br>'''Test Exams'''</br></br>We plan to run two test exam where participation is compulsory and results will count for 10% of the final grade.</br></br>Test Exam 1: Monday 2th November</br></br>Test Exam 2: Wednesday, 9th December</br></br>'''Final Exam''': 19th December, 10am in Room ZEU/255/Z (Zeunerbau, Georg-Bährstrasse 3c).</br></br>'''Written Exam'''</br></br>This course will be examined as a part of the Foundations exam.</br>The Foundation exam consists of two separate exams:</br>a written examination for the course Logic and an oral examination for the course</br>[https://iccl.inf.tu-dresden.de/web/Science_of_Computational_Logic_(WS2015) Science of Computational Logic].</br>The written exam is scheduled shortly before Christmas.</br></br>'''Some remarks on the style of the written exam in logic'''</br>* no exam aids or support materials will be allowed. In other words, only writing materials are allowed.</br>* The emphasis of the exam will be on the proofs of theorems, propositions and lemmata from the lectures and the proofs occurring with the problems from the tutorials.</br>* In addition, in the first problem of the exam we will usually ask for some definition or algorithm presented on the lectures, e.g. define concepts like substitution, resolvent, interpretation, Skolemization, ... or algorithms like unification, transformation to clause form, ...</br>* Maybe, one or two exam problems will be the application of some of the presented calculi (e.g. resolution, natural deduction, normalform transformation, etc).eduction, normalform transformation, etc).)
  • Science of Computational Logic  + (This is the follow-up course to [http://ww … This is the follow-up course to [http://www.computational-logic.org/iccl/master/lectures/winter14/logic/?id=43 Logic].</br>The course will run with 4 hours of lectures and 4 hours of tutorials per week.</br></br>We cover the areas of automated deduction and automated deduction systems, knowledge representation and reasoning, logic-based databases, program development, language design, semantics and verification methods, computational logic and machine learning, computational logic and natural language processing.</br></br>'''NEWS'''</br>* The tutorial on 27.01.2015 is cancelled.</br>* The tutorial on 26.01.2015 is cancelled.</br>* The examination plan is here: [[file:ExaminationPlan-2.pdf]]</br>* The tutorial on 03.02.2015 takes place in room 2026.al on 03.02.2015 takes place in room 2026.)
  • Science of Computational Logic  + (This is the follow-up course to [https://i … This is the follow-up course to [https://iccl.inf.tu-dresden.de/web/Logic_(WS2019) Logic]. It starts on Thurday, 5 December 2018. The course will run with 4 hours of lectures and 4 hours of tutorials per week.</br></br>We cover the areas of automated deduction and automated deduction systems, knowledge representation and reasoning, logic-based databases, program development, language design, semantics and verification methods, computational logic and machine learning, computational logic and natural language processing.</br></br>* The lecture will be offered as a 4/4/0 lecture starting at the beginning of December (after the logic lecture has ended). </br>* Lectures (room APB/E05)</br>** Mondays 4.DS (1:00pm) and Thursday 4.DS (1:00pm)</br>* Exercises </br>** Tuesday 2. DS (9:20am, room APB/2026) and Friday 4. DS (1:00pm, room APB/E05)</br></br></br>===Lecture Slides and Script===</br></br>The lecture slides as well as the script can be found [http://www.wv.inf.tu-dresden.de/materials/logic/ here]. The user name is ''student'' and the password will be given during the lecture or tutorial.</br></br></br>===Exercises===</br>* December 18/20: [https://iccl.inf.tu-dresden.de/w/images/c/c6/1-dl.pdf Exercise sheet 1], all seven problems</br>* January 8/10: [https://iccl.inf.tu-dresden.de/w/images/0/07/Sheet-2.pdf Exercise sheet 2], all eight problems</br>* January 14/17: [https://iccl.inf.tu-dresden.de/w/images/0/02/Sheet-3.pdf Exercise sheet 3], all three problems</br>* January 21/24: [https://iccl.inf.tu-dresden.de/w/images/b/b7/Sheet-5.pdf Exercise sheet 5], all six problems. (Some material has been removed from the lecture course, so Exercise sheet 4 was skipped. )</br>* January 28: [https://iccl.inf.tu-dresden.de/w/images/e/e6/Sheet-6.pdf Exercise sheet 6].</br>* January 31: [https://iccl.inf.tu-dresden.de/w/images/e/e7/Sheet-7.pdf Exercise sheet 7], all three problems.</br>* February 5/7: [https://iccl.inf.tu-dresden.de/w/images/0/0e/Sheet-8.pdf Exercise sheet 8], both problems.</br></br>===Model solutions===</br>* [https://iccl.inf.tu-dresden.de/w/images/1/1f/Sheet-1-sol.pdf Model solution to exercise sheet 1]</br>* [https://iccl.inf.tu-dresden.de/w/images/d/dc/Sheet-2-sol.pdf Model solution to exercise sheet 2]</br>* [https://iccl.inf.tu-dresden.de/w/images/2/26/Sheet-3-sol.pdf Model solution to exercise sheet 3]</br>* [https://iccl.inf.tu-dresden.de/w/images/9/96/Sheet-5-sol.pdf Model solution to exercise sheet 5]</br>* [https://iccl.inf.tu-dresden.de/w/images/5/5f/Sheet-6-sol.pdf Model solution to exercise sheet 6]</br>* [https://iccl.inf.tu-dresden.de/w/images/e/e3/Sheet-7-sol.pdf Model solution to exercise sheet 7]</br>* [https://iccl.inf.tu-dresden.de/w/images/b/bf/Sheet-8-sol.pdf Model solution to exercise sheet 8]ol.pdf Model solution to exercise sheet 8])
  • Science of Computational Logic  + (This is the follow-up course to [https://i … This is the follow-up course to [https://iccl.inf.tu-dresden.de/web/Logic_(WS2016) Logic].</br>The course will run with 4 hours of lectures and 4 hours of tutorials per week.</br></br>We cover the areas of automated deduction and automated deduction systems, knowledge representation and reasoning, logic-based databases, program development, language design, semantics and verification methods, computational logic and machine learning, computational logic and natural language processing.</br></br></br>'''News'''</br>* The tutorial on Thursday, 15th December is canceled; there will be an additional tutorial on Monday, 19th December, 9:20 in room E05</br>* The lecture starts on 5th December, and the tutorials on 15th December</br></br></br>'''Lecture Slides'''</br></br>[[Datei:ws16-scl2016.pdf|Introduction]]</br>[[Datei:ws16-dl2016.pdf|Description Logic]]</br>[[Datei:El2015.pdf|Equational Logic]]</br>[[Datei:ws16-ac.pdf|Actions and Causality]]</br>[[Datei:ws16-dai.pdf|Deduction, Abduction and Induction]]</br>[[Datei:Nmr2016.pdf|Non-Monotonic Reasoning]]</br></br></br>'''Exercise Sheets'''</br></br>[[Datei:ws16-scl2016-sheet-1.pdf|Description Logic]]</br>[[Datei:ws16-scl2016-sheet-2.pdf|Equational Logic]]</br>[[Datei:ws16-scl-e-unification.pdf|E-Unification]]</br>[[Datei:Sheet-3-2015.pdf|Actions and Causality]]</br>[[Datei:Sheet-4-2015.pdf|Abduction]]</br>[[Datei:Sheet-6-2015.pdf|Non-Monotonic Reasoning]]</br>[[Datei:Sheet-7.pdf|Non-Monotonic Reasoning]]</br>[[Datei:Sheet-8-2015.pdf|Non-Monotonic Reasoning]]</br></br>'''Additional exercise for Tuesday, 10th January:''' Prove that the question, whether a given term rewriting system is terminating, is undecidable.ing system is terminating, is undecidable.)
  • Science of Computational Logic  + (This is the follow-up course to [https://i … This is the follow-up course to [https://iccl.inf.tu-dresden.de/web/Logic_(WS2015) Logic].</br>The course will run with 4 hours of lectures and 4 hours of tutorials per week.</br></br>We cover the areas of automated deduction and automated deduction systems, knowledge representation and reasoning, logic-based databases, program development, language design, semantics and verification methods, computational logic and machine learning, computational logic and natural language processing.</br></br>Completion in Equational Logic is not covered this year in the lectures. is not covered this year in the lectures.)
  • Science of Computational Logic  + (This is the follow-up course to [https://i … This is the follow-up course to [https://iccl.inf.tu-dresden.de/web/Logic_(WS2018) Logic]. It starts on Monday, 8 December 2018. The course will run with 4 hours of lectures and 4 hours of tutorials per week.</br></br>We cover the areas of automated deduction and automated deduction systems, knowledge representation and reasoning, logic-based databases, program development, language design, semantics and verification methods, computational logic and machine learning, computational logic and natural language processing.</br></br>* The lecture will be offered as a 4/4/0 lecture starting at the beginning of December (after the logic lecture has ended). </br>* Lecture and tutorial hours are as in the logic lecture</br></br></br>===Lecture Slides and Script===</br></br>The lecture slides as well as the script can be found [http://www.wv.inf.tu-dresden.de/materials/logic/ here]. The user name is ''student'' and the password will be given during the lecture or tutorial.</br></br>===Exercises===</br>* December 20: [https://iccl.inf.tu-dresden.de/w/images/c/c6/1-dl.pdf Exercise sheet 1], all seven problems</br>* January 10: [https://iccl.inf.tu-dresden.de/w/images/0/07/Sheet-2.pdf Exercise sheet 2], all eight problems</br>* January 17: [https://iccl.inf.tu-dresden.de/w/images/0/02/Sheet-3.pdf Exercise sheet 3], all three problems</br>* January 24: [https://iccl.inf.tu-dresden.de/w/images/5/5f/Sheet-4.pdf Exercise sheet 4], all three problems</br>* January 31: [https://iccl.inf.tu-dresden.de/w/images/b/b7/Sheet-5.pdf Exercise sheet 5], all six problems-5.pdf Exercise sheet 5], all six problems)
  • Lab Course “Modeling and Automated Verification”  + (This lab course is intended for students i … This lab course is intended for students in the Master's programs “Computational Logic” and “Computational Modeling and Simulation”. It offers the opportunity to participate in theoretical as well as applied state-of-the-art research projects. Most problems addressed in this course are closely related to or are part of current research projects of our workgroup. See for example:</br></br>* [https://www.perspicuous-computing.science/ CPEC]</br>* [https://ceti.one/ CeTI]</br>* [https://secai.org/de SECAI]</br>* [https://digitalhealth.tu-dresden.de/projects/semeco/ SEMECO]</br>* [http://5glab.de/ 5G-Lab Germany]</br></br>Potential topics include:</br>* Symbolic methods in model checking</br>* Explicit model checking</br>* Reduction techniques</br>* Automata over finite and infinite words</br>* Numerical methods for quantitative analysis</br>* Logics</br>* Specification formalisms</br>* Abstraction techniques</br>* Case studiesms * Abstraction techniques * Case studies)
  • Lab Course “Modeling and Automated Verification”  + (This lab course is intended for students i … This lab course is intended for students in the Master's programs “Computational Logic” and “Computational Modeling and Simulation”. It offers the opportunity to participate in theoretical as well as applied state-of-the-art research projects. Most problems addressed in this course are closely related to or are part of current research projects of our workgroup. See for example:</br></br>* [https://www.perspicuous-computing.science/ CPEC]</br>* [https://ceti.one/ CeTI]</br>* [https://secai.org/de SECAI]</br>* [https://digitalhealth.tu-dresden.de/projects/semeco/ SEMECO]</br>* [http://5glab.de/ 5G-Lab Germany]</br></br>Potential topics include:</br>* Symbolic methods in model checking</br>* Explicit model checking</br>* Reduction techniques</br>* Automata over finite and infinite words</br>* Numerical methods for quantitative analysis</br>* Logics</br>* Specification formalisms</br>* Abstraction techniques</br>* Case studies</br></br>This course is held in English.</br></br>=== Registration ===</br></br>Registration [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48422027273/ via Opal] is required until April 14.</br></br>=== Prerequisites ===</br></br>* Solid foundations in algorithms and data structures, complexity theory, automata theory and formal languages</br>* Solid programming skills</br>* Basic mathematical foundations</br></br>=== Exam and Creditability ===</br></br>'''Master Computational Logic'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=MCL-PS MCL-PS]: ''Projektarbeit inkl. Kolloquium'' (research project with a 10-page documentation <u>and</u> a 30-minute presentation)</br></br>'''Master Computational Modeling and Simulation'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=CMS-LM-MOC CMS-LM-MOC]: ''Projektarbeit inkl. Kolloquium'' (research project with a 10-page documentation <u>and</u> a 30-minute presentation)</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=CMS-LM-ADV CMS-LM-ADV]: ''Projektarbeit inkl. Kolloquium'' (research project with a 10-page documentation <u>and</u> a 30-minute presentation)</br></br></br>=== Contact ===</br></br>In case of organisational questions, please contact [[Sascha Klüppelholz]]. Klüppelholz]].)
  • Lab Course “Modeling and Automated Verification”  + (This lab course is intended for students i … This lab course is intended for students in the Master's program “Computational Logic”. It affords the opportunity to participate in theoretical as well as applied state-of-the-art research projects. Most problems addressed in this course are closely related to or a part of current research projects of our workgroup. See for example:</br>* [https://tu-dresden.de/die_tu_dresden/fakultaeten/fakultaet_elektrotechnik_und_informationstechnik/forschung/sfb912 HAEC]</br>* [https://lat.inf.tu-dresden.de/quantla/ QuantLA]</br>* [https://www.cfaed.tu-dresden.de/ cfAED]</br>* [https://wwwdb.inf.tu-dresden.de/grk/ RoSI]</br>* [http://5glab.de/ 5G-Lab Germany]</br></br>Within these projects, tasks in various areas arise, which include:</br>* Symbolic methods in model checking</br>* Explicit model-checking techniques</br>* Reduction techniques</br>* Omega-automata (probabilistic)</br>* Numerical solution methods</br>* Logics</br>* Specification formalisms</br>* Abstraction techniques</br>* Case studies</br></br>=== Registration and Dates ===</br>To participate, please register using the form on the [https://www.inf.tu-dresden.de/index.php?node_id=3812 course hompage] until Sunday, April 15th, 2018.</br></br>All registered students will be informed about the first meeting via email.</br></br>=== Prerequisites ===</br>* Solid foundations in algorithms and data structures, complexity theory, automata theory and formal languages</br>* Basic mathematical foundations</br>* Programming skills in C/C++ or Java</br></br>=== Course Homepage ===</br>Further details can be found [https://www.inf.tu-dresden.de/index.php?node_id=3812 here].u-dresden.de/index.php?node_id=3812 here].)
  • Academic Skills in Computer Science  + (This lecture is aiming at providing basic … This lecture is aiming at providing basic skills in reading, understanding, and evaluating scientific articles, and in presenting scientific results in presentations and publications. It includes topics like citations and bibliographic data in scientific publications, selection of topics, examples, and results for an oral presentation, preparation of slides and other materials for oral presentations as well as selecting, structuring, and writing scientific articles. The lecture will include practical training in reading and reviewing scientific articles, in preparing and giving presentations, and in setting up and writing short scientific articles. The topics will be selected from Computational Logic. Hence, some familiarity with propositional and first-order logic is assumed.</br></br>== Dates ==</br></br>The lectures and exercise classes generally take place on the following dates:</br>* Lecture: Tuesday, DS3 (11:10–12:40) in room APB E005</br>* Exercise: Tuesday DS5 (14:50–16:20) in room APB E001</br>* '''Due to preparations for Output 2019, there will be no exercise on 2019-06-18'''</br></br>== Mock Conference on Academic Skills in Computer Science ==</br>We are conducting a mock conference to demonstrate the paper submission and reviewing process. Submissions are currently open, see [[Media:asics2019-exercise-09-more-advanced-latex.pdf|Exercise 9.4]] for details.dia:asics2019-exercise-09-more-advanced-latex.pdf|Exercise 9.4]] for details.)
  • Academic Skills in Computer Science  + (This lecture is aiming at providing basic … This lecture is aiming at providing basic skills in reading, understanding, and evaluating scientific articles, and in presenting scientific results in presentations and publications. It includes topics like citations and bibliographic data in scientific publications, selection of topics, examples, and results for an oral presentation, preparation of slides and other materials for oral presentations as well as selecting, structuring, and writing scientific articles. The lecture will include practical training in reading and reviewing scientific articles, in preparing and giving presentations, and in setting up and writing short scientific articles. The topics will be selected from Computational Logic. Hence, some familiarity with propositional and first-order logic is assumed.sitional and first-order logic is assumed.)
  • Seminar Large Language Models and Knowledge-aware AI  + (This seminar discusses advanced topics at the interface of LLMs and KAAI. It is a block seminar and will take place on two consecutive days in the summer term 2025.)
  • Seminar “Selected Topics in Logic and Verification”  + (This seminar is mainly intended for studen … This seminar is mainly intended for students enrolled in the Master or Diplom programs Informatik (computer science).</br></br>This seminar is held in English.</br></br>=== Registration ===</br></br>Registration [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48422027275?58 via Opal] is required until April 14.</br></br>=== Prerequisites ===</br></br>The seminar addresses students that have profound knowledge in theoretical computer science and logics.</br></br>=== Dates === </br></br>All participants will be notified about the initital meeting by e-mail. Each participant is then assigned a topic and a supervisor.</br></br>Presentations will be held between June and August. The specific dates will be announced later. The seminar paper (Seminararbeit) is due by August 16.</br></br>=== Exam and Creditability ===</br></br>'''Bachelor Informatik'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=INF-B-510 INF-B-510]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=INF-B-520 INF-B-520]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br></br>'''Master Informatik'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=INF-AQUA INF-AQUA]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br></br>'''Diplom Informatik'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=INF-D-940 INF-D-940]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br></br>'''Master Medieninformatik'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=INF-AQUA INF-AQUA]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br></br>'''Master Computational Logic'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=MCL-PS MCL-PS]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br></br>'''Master Computational Modeling and Simulation'''</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=CMS-SEM CMS-SEM]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=CMS-LM-MOC CMS-LM-MOC]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=CMS-LM-ADV CMS-LM-ADV]: ''Seminararbeit inkl. Präsentation'' (a 10-page seminar paper <u>and</u> a 30-minute presentation)</br></br>=== Contact ===</br></br>In case of organisational questions, please contact [[Sascha Klüppelholz]].Klüppelholz]].)
  • Research Seminar “Formal Methods”  + (This seminar is mainly intended for studen … This seminar is mainly intended for students enrolled in the Master or Diplom programs Informatik (computer science). Participants engage with selected topics from the field of Model Checking.</br></br>This course is held in English.</br></br>=== Registration ===</br></br>Registration [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48422027282/ via Opal] is required until April 14.</br></br>=== Prerequisites ===</br></br>The seminar addresses students that have profound knowledge in theoretical computer science and logics. Background knowledge in the areas of formal methods (and model checking in particular) or concurrency theory is recommended.</br></br>=== Dates === </br></br>All participants will be notified about the initital meeting by e-mail.</br></br>=== Exam and Creditability ===</br></br>* [http://studies.inf.tu-dresden.de/modforms/index.php?r=modules/view&id=INF-PM-FOR INF-PM-FOR]: exam according to module description</br></br>=== Contact ===</br></br>In case of organisational questions, please contact [[Sascha Klüppelholz]].[[Sascha Klüppelholz]].)
  • Research Seminar “Formal Methods”  + (This seminar is mainly intended for studen … This seminar is mainly intended for students enrolled in the Master or Diplom programs Informatik (computer science). Participants engage with selected topics from the field of Model Checking.</br></br>The seminar addresses students that have profound knowledge in theoretical computer science and logics. Background knowledge in the areas of formal methods (and model checking in particular) or concurrency theory is recommended.lar) or concurrency theory is recommended.)
  • Seminar “Selected Topics in Logic and Verification”  + (This seminar is mainly intended for studen … This seminar is mainly intended for students enrolled in the Master or Diplom programs Informatik (computer science).</br></br>=== Registration and Dates ===</br>To participate, please register using the form on the [https://www.inf.tu-dresden.de/index.php?node_id=3818 course hompage] until Sunday, April 15th, 2018.</br></br>All registered students will be informed about the first meeting via email.</br></br>=== Prerequisites ===</br>The seminar addresses students that have profound knowledge in theoretical computer science and logics.</br>* For students of the Master or Diplom program Informatik, the material of the course “Formale Systeme” and “Theoretische Informatik und Logik” is required.</br>* The seminar is intended for students of the Master program Computational Logic in the second year of their studies that have successfully completed at least one of the following courses: “Model Checking” or “Advanced Logics”.</br></br>=== Course Homepage ===</br>Further details can be found [https://www.inf.tu-dresden.de/index.php?node_id=3818 here].u-dresden.de/index.php?node_id=3818 here].)
  • Seminar “Selected Topics in Logic and Verification”  + (This seminar is mainly intended for students enrolled in the Master or Diplom programs Informatik (computer science). The seminar addresses students that have profound knowledge in theoretical computer science and logics.)
  • SAT-Solving  + (Vorlesung: Montag, 4. DS Übung: Montag, 5. … Vorlesung: Montag, 4. DS Übung: Montag, 5. DS</br></br><b>Die Vorlesung beginnt immer 13:15 und endet dafür 14:45 Uhr</b><br></br></br>Das Erfüllbarkeitsproblem (SAT) der Aussagenlogik ist ein fundamentales Entscheidungsproblem der Informatik, und das repräsentative Problem der Komplexitätsklasse NP. Neben vielen akademischen Anwendungen, die sich auf SAT reduzieren lassen, gibt es auch industriell relevante Probleme, die gelöst werden können. Einige Beispiele sind das Lösen von Sudokus, das Lösen von Hamiltonion Path und Hamiltonian Cycle Problemen, aber auch die Verifikation von Hardware und Software. Selbst Attacken auf Crypthographie-Verfahren sind mit SAT möglich.</br></br>In den letzten zwei Jahrzehnten wurden SAT Solver -- Algorithmen die das Efüllbarkeitsproblem lösen -- wesentlich verbessert, und gehen weit über den DPLL Algorithmus der 1960er hinaus. Die Vorlesung präsentiert zum einen die theoretischen Grundlagen, auf denen SAT Solver aufbauen und führt Lösungsalgorithmen abstrakt ein und diskutiert Eigenschaften, die ausgenutzt werden können, um effiziente SAT Solver zu erhalten.</br></br>Auf der anderen Seite werden interna von SAT Solvern beleuchtet, und verwandte Anwendungen aufgezeigt. So kann mit MaxSAT -- der Optimierungsvariante des Erfüllbarkeitsproblems -- eine beste Lösung gefunden werden, oder durch mehrfaches Aufrufen eines Solvers eine kleinste unerfüllbare Teilformel gefunden werden. Die Varianten des Lösens werden ebenso diskutiert, wie das parallele Lösen des SAT Problems. Dabei wird auch auf die effiziente Implementierung geachtet.</br></br>In den Übungen werden sowohl theoretische als auch praktische Aufgabenstellungen gegeben. Es sollen sowohl Lösungsalgrithmen implementiert, als auch Probleme auf das SAT Problem reduziert werden.ert, als auch Probleme auf das SAT Problem reduziert werden.)
  • Quotation in Formal Logics and the Web  + (When formalising knowledge in order to pro … When formalising knowledge in order to process it with the computer and to reason upon it, we often encounter situations in which people make statements about statements or in which they talk about a term instead of its meaning. As an illustration consider the following sentences:</br></br> Alice is a girl. </br> Alice has 5 letters. </br> Bob says that Alice is a girl. </br></br>The second and the third sentence are examples of quotations. “Alice” as present in the first sentence refers to a different object than “Alice” in the second sentence. The third sentence somehow refers to the first one and it depends on the intended use of the third sentence how this “somehow” can be further specified.</br></br>That quotation is not only of theoretical relevance but also interesting in practice can for example be observed in the Semantic Web where the standard Resource Description Framework (RDF) is currently extended by the opportunity to make statements about statements. The semantics of this extension, called RDF-star, will also depend on the industrial use cases this form of quotation is supposed to solve.</br></br>In this lecture, we will closely follow the standardisation progress of RDF-star and the different possible ways to define its semantics. Additionally, we will also take a broader look at the handling of quotation in other logical frameworks such as first order logic, common logic and modal logic.</br></br>The lecture and exercises are planned as a mixture of introductory lectures, discussions about different research approaches, and a few practical lessons implementing some of the proposals. </br></br></br>The lectures will take place on Tuesdays, 2. DS in MER/0003/U, exercises Wednesdays, 3. DS in BAR/0I89/U.</br></br>The first lecture will be on the 18th of April.</br></br>Please contact me (mailto:doerthe.arndt@tu-dresden.de) in case of questions.arndt@tu-dresden.de) in case of questions.)
  • Term Rewriting Systems  + ([https://lat.inf.tu-dresden.de/teaching/ss2016/TRS/ https://lat.inf.tu-dresden.de/teaching/ss2016/TRS/])
  • Informatik für Biologen  + (http://lat.inf.tu-dresden.de/teaching/ws2014-2015/BIO/)
Abgerufen von „https://iccl.inf.tu-dresden.de/web/Spezial:Suche_mittels_Attribut/:Beschreibung/http:-2F-2Flat.inf.tu-2Ddresden.de-2Fteaching-2Fws2014-2D2015-2FDL-2F“