https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Lukas+Schweizer 2026-04-18T05:02:51Z Benutzerbeiträge MediaWiki 1.43.1 https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=31102 2020-08-04T08:24:13Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Update ==<br /> * All sessions will be held via https://jitsi.tu-dresden.de/LogicalModelling<br /> <br /> == COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming I<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programmin II<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Web Ontology Language I<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS3<br /> |Download=LM-SOSE-2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Web Ontology Language II - Reasoning<br /> |Room=APB E005<br /> |Date=2020/05/25<br /> |DS=DS3<br /> |Download=Pizza.zip<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Presentations<br /> |Room=APB E005<br /> |Date=2020/08/07<br /> |DS=DS2<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30965 2020-07-09T12:35:28Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=== Update ==<br /> * For the tutorials (and maybe other live-/interactive sessions we will use the Jitsi session: https://jitsi.tu-dresden.de/DeductionSystems<br /> * More exercises online!<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> |Download=DS-2020-L1-DL-Intro.pdf,DS-2020-L1-DL-Intro-script.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> |Download=DS-2020-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 1<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS5<br /> |Download=DS2020-L2-Tableau1.pdf,DS2020-L2-Tableau1-1.mkv,DS2020-L2-Tableau1-2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tablaux<br /> |Room=APB E005<br /> |Date=2020/05/11<br /> |DS=DS5<br /> |Download=DS-2020-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 2<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS5<br /> |Download=DS2020-L3-Tableau2.pdf,DS2020-L3-Tableau2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux Optimizations<br /> |Room=APB E005<br /> |Date=2020/05/18<br /> |DS=DS5<br /> |Download=DS2020-L4-Optimizations.pdf,DS2020-L4-Optimizations.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tableaux II<br /> |Room=APB E005<br /> |Date=2020/05/25<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tableaux II Ctd.<br /> |Room=APB E005<br /> |Date=2020/06/08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer Set Programming – Basics<br /> |Room=APB E005<br /> |Date=2020/06/15<br /> |DS=DS5<br /> |Download=DS-2020-L5-ASP-Basics.pdf,DS-2020-L5-ASP-Basics.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=ASP: Hands-on Tools<br /> |Room=APB E005<br /> |Date=2020/06/22<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer Set Programming – Solving (1/2)<br /> |Room=APB E005<br /> |Date=2020/06/29<br /> |DS=DS5<br /> |Download=DS-2020-L6-ASP-Solving.pdf,DS-2020-L6-ASP-Solving1.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer Set Programming – Solving (2/2)<br /> |Room=APB E005<br /> |Date=2020/07/06<br /> |DS=DS5<br /> |Download=DS-2020-L6-ASP-Solving2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=ASP Solving<br /> |Room=APB E005<br /> |Date=2020/07/13<br /> |DS=DS5<br /> |Download=DS-2020-T4-ASPSolving.pdf,<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:DS-2020-T4-ASPSolving.pdf&diff=30964 2020-07-09T12:35:01Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30850 2020-06-22T09:08:27Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=== Update ==<br /> * For the tutorials (and maybe other live-/interactive sessions we will use the Jitsi session: https://jitsi.tu-dresden.de/DeductionSystems<br /> * More exercises online!<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> |Download=DS-2020-L1-DL-Intro.pdf,DS-2020-L1-DL-Intro-script.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> |Download=DS-2020-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 1<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS5<br /> |Download=DS2020-L2-Tableau1.pdf,DS2020-L2-Tableau1-1.mkv,DS2020-L2-Tableau1-2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tablaux<br /> |Room=APB E005<br /> |Date=2020/05/11<br /> |DS=DS5<br /> |Download=DS-2020-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 2<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS5<br /> |Download=DS2020-L3-Tableau2.pdf,DS2020-L3-Tableau2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux Optimizations<br /> |Room=APB E005<br /> |Date=2020/05/18<br /> |DS=DS5<br /> |Download=DS2020-L4-Optimizations.pdf,DS2020-L4-Optimizations.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tableaux II<br /> |Room=APB E005<br /> |Date=2020/05/25<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tableaux II Ctd.<br /> |Room=APB E005<br /> |Date=2020/06/08<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer Set Programming – Basics<br /> |Room=APB E005<br /> |Date=2020/06/15<br /> |DS=DS5<br /> |Download=DS-2020-L5-ASP-Basics.pdf,DS-2020-L5-ASP-Basics.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=ASP: Hands-on Tools<br /> |Room=APB E005<br /> |Date=2020/06/22<br /> |DS=DS5<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30784 2020-06-07T14:49:24Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=== Update ==<br /> * For the tutorials (and maybe other live-/interactive sessions we will use the Jitsi session: https://jitsi.tu-dresden.de/DeductionSystems<br /> * More exercises online!<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> |Download=DS-2020-L1-DL-Intro.pdf,DS-2020-L1-DL-Intro-script.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> |Download=DS-2020-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 1<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS5<br /> |Download=DS2020-L2-Tableau1.pdf,DS2020-L2-Tableau1-1.mkv,DS2020-L2-Tableau1-2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tablaux<br /> |Room=APB E005<br /> |Date=2020/05/11<br /> |DS=DS5<br /> |Download=DS-2020-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 2<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS5<br /> |Download=DS2020-L3-Tableau2.pdf,DS2020-L3-Tableau2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux Optimizations<br /> |Room=APB E005<br /> |Date=2020/05/18<br /> |DS=DS5<br /> |Download=DS2020-L4-Optimizations.pdf,DS2020-L4-Optimizations.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tableaux II<br /> |Room=APB E005<br /> |Date=2020/05/25<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tableaux II Ctd.<br /> |Room=APB E005<br /> |Date=2020/06/08<br /> |DS=DS5<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30602 2020-05-25T08:32:54Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Update ==<br /> * All sessions will be held via https://jitsi.tu-dresden.de/LogicalModelling<br /> <br /> == COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming I<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programmin II<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Web Ontology Language I<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS3<br /> |Download=LM-SOSE-2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Web Ontology Language II - Reasoning<br /> |Room=APB E005<br /> |Date=2020/05/25<br /> |DS=DS3<br /> |Download=Pizza.zip,<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30573 2020-05-18T13:04:53Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=== Update ==<br /> * For the tutorials (and maybe other live-/interactive sessions we will use the Jitsi session: https://jitsi.tu-dresden.de/DeductionSystems<br /> * More exercises online!<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> |Download=DS-2020-L1-DL-Intro.pdf,DS-2020-L1-DL-Intro-script.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> |Download=DS-2020-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 1<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS5<br /> |Download=DS2020-L2-Tableau1.pdf,DS2020-L2-Tableau1-1.mkv,DS2020-L2-Tableau1-2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Tablaux<br /> |Room=APB E005<br /> |Date=2020/05/11<br /> |DS=DS5<br /> |Download=DS-2020-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 2<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS5<br /> |Download=DS2020-L3-Tableau2.pdf,DS2020-L3-Tableau2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux Optimizations<br /> |Room=APB E005<br /> |Date=2020/05/18<br /> |DS=DS5<br /> |Download=DS2020-L4-Optimizations.pdf,DS2020-L4-Optimizations.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial:: Tableaux II<br /> |Room=APB E005<br /> |Date=2020/05/25<br /> |DS=DS5<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30482 2020-05-06T16:03:29Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=== Update ==<br /> * For the tutorials (and maybe other live-/interactive sessions we will use the Jitsi session: https://jitsi.tu-dresden.de/DeductionSystems<br /> * More exercises online!<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> |Download=DS-2020-L1-DL-Intro.pdf,DS-2020-L1-DL-Intro-script.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> |Download=DS-2020-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tableaux 1<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS5<br /> |Download=DS2020-L2-Tableau1.pdf,DS2020-L2-Tableau1-1.mkv,DS2020-L2-Tableau1-2.mkv<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tutorial: Tablaux<br /> |Room=APB E005<br /> |Date=2020/05/11<br /> |DS=DS5<br /> |Download=DS-2020-T2.pdf,<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:DS-2020-T2.pdf&diff=30481 2020-05-06T16:03:27Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30457 2020-05-03T21:41:33Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Update ==<br /> * All sessions will be held via https://jitsi.tu-dresden.de/LogicalModelling<br /> <br /> == COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming I<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programmin II<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Web Ontology Language I<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS3<br /> |Download=LM-SOSE-2020.pdf,<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:LM-SOSE-2020.pdf&diff=30456 2020-05-03T21:41:29Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30454 2020-05-03T13:44:07Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Update ==<br /> * All sessions will be held via https://jitsi.tu-dresden.de/LogicalModelling<br /> <br /> == COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming I<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programmin II<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Web Ontology Language I<br /> |Room=APB E005<br /> |Date=2020/05/04<br /> |DS=DS3<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30403 2020-04-26T20:12:37Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Update ==<br /> * All sessions will be held via https://jitsi.tu-dresden.de/LogicalModelling<br /> <br /> == COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming I<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programmin II<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS3<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30402 2020-04-26T20:11:41Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Update ==<br /> * The Answer-Set Programming Session today is held via https://jitsi.tu-dresden.de/LogicalModelling<br /> <br /> == COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming I<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programmin II<br /> |Room=APB E005<br /> |Date=2020/04/27<br /> |DS=DS3<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30355 2020-04-20T08:00:32Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Update ==<br /> * The Answer-Set Programming Session today is held via https://jitsi.tu-dresden.de/LogicalModelling<br /> <br /> == COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30354 2020-04-20T07:39:34Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Answer-Set Programming<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS3<br /> |Download=LM-ASP2020.pdf,<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:LM-ASP2020.pdf&diff=30353 2020-04-20T07:39:31Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30348 2020-04-19T18:40:45Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=== Update ==<br /> * For the tutorials (and maybe other live-/interactive sessions we will use the Jitsi session: https://jitsi.tu-dresden.de/DeductionSystems<br /> * More exercises online!<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> |Download=DS-2020-L1-DL-Intro.pdf,DS-2020-L1-DL-Intro-script.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> |Download=DS-2020-T1.pdf<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30347 2020-04-19T18:32:29Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=&lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> |Download=DS-2020-L1-DL-Intro.pdf,DS-2020-L1-DL-Intro-script.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> |Download=DS-2020-T1.pdf,<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:DS-2020-T1.pdf&diff=30346 2020-04-19T18:32:24Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30258 2020-04-06T08:51:19Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> |Literature=== OWL ==<br /> === Description Logic ===<br /> * Foundations of Description Logics: http://aifb.kit.edu/images/1/19/DL-Intro.pdf<br /> * From DL(s) to OWL: http://www.websemanticsjournal.org/index.php/ps/article/download/24/22<br /> <br /> === Ontology Editor ===<br /> * https://protege.stanford.edu/<br /> <br /> === W3C ===<br /> * https://www.w3.org/TR/owl2-overview/<br /> <br /> == ASP ==<br /> * https://potassco.org/teaching/<br /> <br /> === Tools ===<br /> * https://potassco.org/clingo/<br /> <br /> == FO(.) + IDP3 ==<br /> * System + Material: https://dtai.cs.kuleuven.be/software/idp/fo<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30257 2020-04-05T20:17:02Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=&lt;span style=&quot;color:red;&quot;&gt;Due to the current COVID19 situation, this course will be held virtually until further notice. The content of the lecture will be made available as videos (i.e. slideshows with audio comments). The first upload will be within the first semester week (i.e. before easter).<br /> The format of the tutorials will be announced here shortly. <br /> &lt;/span&gt;<br /> <br /> &lt;span style=&quot;color:red;&quot;&gt;<br /> Students interested in participating in the lecture please register via: &lt;br&gt;<br /> https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23143514207<br /> &lt;/span&gt;<br /> <br /> Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction to Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial: Description Logics<br /> |Room=APB E005<br /> |Date=2020/04/20<br /> |DS=DS5<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30237 2020-04-01T16:59:20Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== COVID-19 News ==<br /> * Please subscribe in OPAL for this seminar: https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/23234641951<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30236 2020-04-01T16:53:38Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== News ==<br /> * We will meet virtually on Monday, 6th April DS 3, for the first time via Zoom: https://zoom.us/j/727929677<br /> * Please let us know if this is not possible for you, and we try to find some other solution.<br /> <br /> == Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Initial Discussion &amp; Introduction<br /> |Room=APB E005<br /> |Date=2020/04/06<br /> |DS=DS3<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30204 2020-03-30T14:35:38Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Description ==<br /> <br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> * OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> * Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> * FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)/en&diff=30203 2020-03-30T14:35:03Z

<p>Lukas Schweizer: Page created automatically by parser function on page Seminar: Logical Modelling (SS2020)</p> <hr /> <div>{{Vorlesung/en}}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Seminar:_Logical_Modelling_(SS2020)&diff=30202 2020-03-30T14:35:03Z

<p>Lukas Schweizer: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Seminar: Logical Modelling |Research group=Computational Logic |Lecturers=Sebastian Rudolph; Lukas Schweizer |Term=SS |Year=2020 |Module=INF…“</p> <hr /> <div>{{Vorlesung<br /> |Title=Seminar: Logical Modelling<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph; Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=INF-BAS2, INF-VERT2, MCL-PS<br /> |SWSLecture=0<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Hausarbeit, Referat<br /> |Description=== Description ==<br /> This seminar intends to address the topic of practical modeling in knowledge representation languages. As formalisms, we will cover<br /> <br /> OWL (the popular Web Ontology Language used in the Semantic Web but also for offline knowledge management solutions)<br /> Answer Set Programming, a logic programming approach used for modeling search and constraint satisfaction problems, and<br /> FO(ID) and the IDP System.<br /> <br /> All approaches come with a good tool support for modeling and automated inferencing. After a few initial sessions to provide the basics, the students will be asked to logically model a certain domain and later present the result(s) and explain the design decisions made.<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30201 2020-03-30T14:31:49Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |Module=MCL-ILS, INF-BAS2<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)/en&diff=30200 2020-03-30T14:30:24Z

<p>Lukas Schweizer: Page created automatically by parser function on page Deduction Systems (SS2020)</p> <hr /> <div>{{Vorlesung/en}}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Deduction_Systems_(SS2020)&diff=30199 2020-03-30T14:30:24Z

<p>Lukas Schweizer: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Deduction Systems |Research group=Computational Logic |Lecturers=Sebastian Rudolph |Tutors=Lukas Schweizer |Term=SS |Year=2020 |SWSLecture=1…“</p> <hr /> <div>{{Vorlesung<br /> |Title=Deduction Systems<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=SS<br /> |Year=2020<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Students will be introduced to the design and use of various deduction systems: Tableaux-Prover and Answer Set Programming.<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Constraint_Programming_(WS2019)&diff=30102 2020-02-03T11:09:04Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Constraint Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-LCP<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== News ==<br /> * 1st Exercise Sheet is online<br /> <br /> == Description ==<br /> Many natural computation problems can be formulated as constraint satisfaction problems: given a finite set of variables and a finite set of constraints, the question is whether there is a solution that satisfies all conditions. For which types of constraints can CSPs be solved efficiently, and with which algorithms? For which CSPs can such algorithms not exist?<br /> |Literature=* Krzysztof Apt. Constraint Programming, Cambridge University Press. 2003.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS6<br /> |Download=FCP-L1-Introduction.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS6<br /> |Download=FCP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP in a Nutshell<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS6<br /> |Download=FCP-L2-CP in a Nutshell.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS6<br /> |Download=FCP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS6<br /> |Download=FCP-L3-Complete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS6<br /> |Download=FCP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Consistency<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS6<br /> |Download=FCP-L4-Local Consistency.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS6<br /> |Download=FCP2019-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Incomplete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS6<br /> |Download=FCP-L5-Incomplete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS6<br /> |Download=FCP2019-T5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Constraint Propagation<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS6<br /> |Download=FCP-L6-Constraint Propagation.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS6<br /> |Download=FCP2019-T6.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Search<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS6<br /> |Download=FCP-L7-Search.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS6<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2019)&diff=30095 2020-01-31T08:44:32Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |SWSLecture=2<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== Description ==<br /> Logic programming supports the declarative programming paradigm, which describes the solution logically rather than how to compute it. This introductory course covers the fundamental topics of logic programming such as rule-based syntax, procedural and declarative semantics, negation, the logic programming language PROLOG, and answer set programming (ASP).<br /> |Literature=* Krzysztof R. Apt. From Logic Programming to Prolog. Prentice Hall 1997.<br /> * Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Answer Set Solving in Practice. Morgan and Claypool 2012.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS5<br /> |Download=FLP L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS5<br /> |Download=FLP L2-Unification.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/25<br /> |DS=DS5<br /> |Download=FLP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Procedural Interpretation<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS5<br /> |Download=FLP-L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/08<br /> |DS=DS5<br /> |Download=FLP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS5<br /> |Download=FLP-L5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Procedural Interpretation<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS5<br /> |Download=FLP-L6.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS5<br /> |Download=FLP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Declarative Interpretation I<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS5<br /> |Download=FLP-L4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Declarative Interpretation II<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/06<br /> |DS=DS5<br /> |Download=FLP2019-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Declarative Interpretation<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS5<br /> |Download=FLP-L7.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Termination<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS5<br /> |Download=FLP-L8.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/20<br /> |DS=DS5<br /> |Download=FLP2019-T5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Introduction<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS5<br /> |Download=FLP-ASP-L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Stable Models<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS5<br /> |Download=FLP-ASP-L2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/17<br /> |DS=DS5<br /> |Download=FLP2019-T6.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Solving<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS5<br /> |Download=FLP-ASP-L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/01/27<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/31<br /> |DS=DS5<br /> |Download=FLP2019-T7.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS5<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2019-T7.pdf&diff=30094 2020-01-31T08:44:28Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Constraint_Programming_(WS2019)&diff=30017 2020-01-20T09:23:28Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Constraint Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-LCP<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== News ==<br /> * 1st Exercise Sheet is online<br /> <br /> == Description ==<br /> Many natural computation problems can be formulated as constraint satisfaction problems: given a finite set of variables and a finite set of constraints, the question is whether there is a solution that satisfies all conditions. For which types of constraints can CSPs be solved efficiently, and with which algorithms? For which CSPs can such algorithms not exist?<br /> |Literature=* Krzysztof Apt. Constraint Programming, Cambridge University Press. 2003.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS6<br /> |Download=FCP-L1-Introduction.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS6<br /> |Download=FCP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP in a Nutshell<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS6<br /> |Download=FCP-L2-CP in a Nutshell.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS6<br /> |Download=FCP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS6<br /> |Download=FCP-L3-Complete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS6<br /> |Download=FCP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Consistency<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS6<br /> |Download=FCP-L4-Local Consistency.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS6<br /> |Download=FCP2019-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Incomplete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS6<br /> |Download=FCP-L5-Incomplete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS6<br /> |Download=FCP2019-T5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Constraint Propagation<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS6<br /> |Download=FCP-L6-Constraint Propagation.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS6<br /> |Download=FCP2019-T6.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Search<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS6<br /> |Download=FCP-L7-Search.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/30<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS6<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FCP2019-T6.pdf&diff=30016 2020-01-20T09:22:31Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2019)&diff=30012 2020-01-17T11:47:22Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |SWSLecture=2<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== Description ==<br /> Logic programming supports the declarative programming paradigm, which describes the solution logically rather than how to compute it. This introductory course covers the fundamental topics of logic programming such as rule-based syntax, procedural and declarative semantics, negation, the logic programming language PROLOG, and answer set programming (ASP).<br /> |Literature=* Krzysztof R. Apt. From Logic Programming to Prolog. Prentice Hall 1997.<br /> * Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Answer Set Solving in Practice. Morgan and Claypool 2012.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS5<br /> |Download=FLP L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS5<br /> |Download=FLP L2-Unification.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/25<br /> |DS=DS5<br /> |Download=FLP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Procedural Interpretation<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS5<br /> |Download=FLP-L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/08<br /> |DS=DS5<br /> |Download=FLP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS5<br /> |Download=FLP-L5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Procedural Interpretation<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS5<br /> |Download=FLP-L6.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS5<br /> |Download=FLP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Declarative Interpretation I<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS5<br /> |Download=FLP-L4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Declarative Interpretation II<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/06<br /> |DS=DS5<br /> |Download=FLP2019-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Declarative Interpretation<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS5<br /> |Download=FLP-L7.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Termination<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS5<br /> |Download=FLP-L8.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/20<br /> |DS=DS5<br /> |Download=FLP2019-T5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Introduction<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS5<br /> |Download=FLP-ASP-L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Stable Models<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS5<br /> |Download=FLP-ASP-L2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/17<br /> |DS=DS5<br /> |Download=FLP2019-T6.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Solving<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS5<br /> |Download=FLP-ASP-L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/01/27<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/31<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS5<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2019-T6.pdf&diff=30011 2020-01-17T11:47:16Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Problem_Solving_and_Search_in_Artificial_Intelligence_(WS2019)&diff=30001 2020-01-15T08:52:03Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Problem Solving and Search in Artificial Intelligence<br /> |Research group=Computational Logic<br /> |Lecturers=Sarah Alice Gaggl<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-KR, MCL-PI<br /> |SWSLecture=2<br /> |SWSExercise=1<br /> |SWSPractical=2<br /> |Exam type=mündliche Prüfung<br /> |Description=Problem solving and search is a central topic in Artificial Intelligence. This course presents several techniques to solve in general difficult problems.<br /> <br /> The course covers the following '''topics''':<br /> *Basic Concepts<br /> *Uninformed vs Informed Search<br /> *Local Search, Stochastic Hill Climbing, Simulated Annealing<br /> *Tabu Search<br /> *Answer Set Programming<br /> *Constraint Satisfaction<br /> *Evolutionary Algorithms, Genetic Algorithms<br /> *Structural Decomposition Techniques (Tree/Hypertree Decompositions)<br /> <br /> <br /> ===Learning Outcomes===<br /> *The students should identify why typical AI problems are difficult to solve<br /> *The students will analyze different algorithms and methods for AI problems and identify when their application is appropriate <br /> *The connections between the (graph) structure and the complexity of a problem should become clear, as well as which methods can be used to tackle the problem<br /> *In the practical part, the students will analyze a given problem and develop a solution for it. <br /> <br /> ===Prerequisites===<br /> Basic knowledge of theoretical computer science and Logic.<br /> <br /> ===Organisation===<br /> The goals can be acquierd by studying the lecture material, solving the exercises of the tutorials and developing an<br /> implementation for a practical problem.<br /> <br /> The practical work should be performed in groups of two students throughout the semester with regular updates on the progress.<br /> <br /> The lecture will be on Tuesday DS1 and the tutorials and practical sessions on Thursday DS1. Please check the concrete schedule for changes.<br /> <br /> &lt;!--'''The number of participants is limited to 20 students.--&gt; <br /> '''The course is full, no furhter registrations will be accepted.'''<br /> &lt;!--To register send an [mailto:sarah.gaggl@tu-dresden.de?Subject=PSSAI%20WS2019%20&amp;body=Your%20Text e-mail].'''--&gt;<br /> |Literature=*Stuart J. Russell and Peter Norvig. &quot;Artificial Intelligence A Modern Approach&quot; (3. edition ). Pearson Education, 2010.<br /> *Zbigniew Michalewicz and David B. Fogel. &quot;How to Solve It: Modern Heuristics&quot;, volume 2. Springer, 2004.<br /> *Martin Gebser, Benjamin Kaufmann Roland Kaminski, and Torsten Schaub. &quot;Answer Set Solving in Practice&quot;. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, 2012.<br /> *Michael Gelfond and Vladimir Lifschitz. &quot;Classical negation in logic programs and disjunctive databases&quot;. New Generation Comput., 9(3–4):365–386, 1991.<br /> *A.E. Eiben and J.E. Smith. &quot;Introduction to Evolutionary Computing&quot;, Springer, 2003.<br /> *Thomas Hammerl, Nysret Musliu and Werner Schafhauser. &quot;Metaheuristic Algorithms and Tree Decomposition&quot;, Handbook of Computational Intelligence, pp 1255–1270, Springer, 2015.<br /> *Hans L. Bodlaender, Arie M.C.A. Koster. &quot;Treewidth computations I. Upper bounds&quot;, Comput. 208(2): 259–275, 2010.<br /> *Georg Gottlob, Nicola Leone, and Francesco Scarcello. &quot;Hypertree decompositions and tractable queries&quot;, Journal of Computer and System Sciences, 64(3):579–627, 2002. ISSN 0022-0000.<br /> *Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, and Marko Samer. &quot;Heuristic methods for hypertree decomposition&quot;, In Alexander Gelbukh and Eduardo F. Morales, editors, MICAI 2008: Advances in Artificial Intelligence, volume 5317 of LNCS, pages 1–11. Springer Berlin Heidelberg, 2008. ISBN 978-3-540-88635-8.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/15<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Informed vs. Uninformed Search<br /> |Room=APB E005<br /> |Date=2019/10/22<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Topic<br /> |Room=APB E005<br /> |Date=2019/10/24<br /> |DS=DS1<br /> |Download=PSSAIWS2019 PA.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Search<br /> |Room=APB E005<br /> |Date=2019/10/29<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 1 (Local Search)<br /> |Room=APB E005<br /> |Date=2019/11/07<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tabu Search<br /> |Room=APB E005<br /> |Date=2019/11/12<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 1<br /> |Room=APB E005<br /> |Date=2019/11/14<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 2 (Tabu Search)<br /> |Room=APB E005<br /> |Date=2019/11/19<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 3 (ASP 1)<br /> |Room=APB E005<br /> |Date=2019/11/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 2<br /> |Room=APB E005<br /> |Date=2019/11/26<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L6+7.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Discussion<br /> |Room=APB E005<br /> |Date=2019/11/28<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 3<br /> |Room=APB E005<br /> |Date=2019/12/03<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 4 (ASP 2)<br /> |Room=APB E005<br /> |Date=2019/12/05<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP<br /> |Room=APB E005<br /> |Date=2019/12/10<br /> |DS=DS1<br /> |Download=PSSAI201920 L8.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 5 (CSP)<br /> |Room=APB E005<br /> |Date=2019/12/19<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Evolutionary Algorithms<br /> |Room=APB E005<br /> |Date=2019/12/17<br /> |DS=DS1<br /> |Download=PSSAI201920 L9.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 1<br /> |Room=APB E005<br /> |Date=2020/01/07<br /> |DS=DS1<br /> |Download=PSSAI201920 L10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 2<br /> |Room=APB E005<br /> |Date=2020/01/14<br /> |DS=DS1<br /> |Download=PSSAI201920 L11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 6 (Structural Decompositions)<br /> |Room=APB E005<br /> |Date=2020/01/16<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T6.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/23<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/01/28<br /> |DS=DS1<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:PSSAI-WS19-T6.pdf&diff=30000 2020-01-15T08:51:59Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Constraint_Programming_(WS2019)&diff=29985 2020-01-12T11:26:26Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Constraint Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-LCP<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== News ==<br /> * 1st Exercise Sheet is online<br /> <br /> == Description ==<br /> Many natural computation problems can be formulated as constraint satisfaction problems: given a finite set of variables and a finite set of constraints, the question is whether there is a solution that satisfies all conditions. For which types of constraints can CSPs be solved efficiently, and with which algorithms? For which CSPs can such algorithms not exist?<br /> |Literature=* Krzysztof Apt. Constraint Programming, Cambridge University Press. 2003.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS6<br /> |Download=FCP-L1-Introduction.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS6<br /> |Download=FCP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP in a Nutshell<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS6<br /> |Download=FCP-L2-CP in a Nutshell.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS6<br /> |Download=FCP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS6<br /> |Download=FCP-L3-Complete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS6<br /> |Download=FCP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Consistency<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS6<br /> |Download=FCP-L4-Local Consistency.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS6<br /> |Download=FCP2019-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Incomplete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS6<br /> |Download=FCP-L5-Incomplete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS6<br /> |Download=FCP2019-T5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Constraint Propagation<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS6<br /> |Download=FCP-L6-Constraint Propagation.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Search<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS6<br /> |Download=FCP-L7-Search.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/30<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS6<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2019)&diff=29937 2019-12-20T08:17:34Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |SWSLecture=2<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== Description ==<br /> Logic programming supports the declarative programming paradigm, which describes the solution logically rather than how to compute it. This introductory course covers the fundamental topics of logic programming such as rule-based syntax, procedural and declarative semantics, negation, the logic programming language PROLOG, and answer set programming (ASP).<br /> |Literature=* Krzysztof R. Apt. From Logic Programming to Prolog. Prentice Hall 1997.<br /> * Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub. Answer Set Solving in Practice. Morgan and Claypool 2012.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS5<br /> |Download=FLP L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS5<br /> |Download=FLP L2-Unification.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/25<br /> |DS=DS5<br /> |Download=FLP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Procedural Interpretation<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS5<br /> |Download=FLP-L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/08<br /> |DS=DS5<br /> |Download=FLP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS5<br /> |Download=FLP-L5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Procedural Interpretation<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS5<br /> |Download=FLP-L6.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS5<br /> |Download=FLP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Declarative Interpretation I<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS5<br /> |Download=FLP-L4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Declarative Interpretation II<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/06<br /> |DS=DS5<br /> |Download=FLP2019-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Declarative Interpretation<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS5<br /> |Download=FLP-L7.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Termination<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS5<br /> |Download=FLP-L8.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/20<br /> |DS=DS5<br /> |Download=FLP2019-T5.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Introduction<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS5<br /> |Download=FLP-ASP-L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Stable Models<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS5<br /> |Download=FLP-ASP-L2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/17<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Solving<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS5<br /> |Download=FLP-ASP-L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/01/27<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/31<br /> |DS=DS5<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS5<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2019-T5.pdf&diff=29936 2019-12-20T08:17:31Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Problem_Solving_and_Search_in_Artificial_Intelligence_(WS2019)&diff=29926 2019-12-18T09:13:44Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Problem Solving and Search in Artificial Intelligence<br /> |Research group=Computational Logic<br /> |Lecturers=Sarah Alice Gaggl<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-KR, MCL-PI<br /> |SWSLecture=2<br /> |SWSExercise=1<br /> |SWSPractical=2<br /> |Exam type=mündliche Prüfung<br /> |Description=Problem solving and search is a central topic in Artificial Intelligence. This course presents several techniques to solve in general difficult problems.<br /> <br /> The course covers the following '''topics''':<br /> *Basic Concepts<br /> *Uninformed vs Informed Search<br /> *Local Search, Stochastic Hill Climbing, Simulated Annealing<br /> *Tabu Search<br /> *Answer Set Programming<br /> *Constraint Satisfaction<br /> *Evolutionary Algorithms, Genetic Algorithms<br /> *Structural Decomposition Techniques (Tree/Hypertree Decompositions)<br /> <br /> <br /> ===Learning Outcomes===<br /> *The students should identify why typical AI problems are difficult to solve<br /> *The students will analyze different algorithms and methods for AI problems and identify when their application is appropriate <br /> *The connections between the (graph) structure and the complexity of a problem should become clear, as well as which methods can be used to tackle the problem<br /> *In the practical part, the students will analyze a given problem and develop a solution for it. <br /> <br /> ===Prerequisites===<br /> Basic knowledge of theoretical computer science and Logic.<br /> <br /> ===Organisation===<br /> The goals can be acquierd by studying the lecture material, solving the exercises of the tutorials and developing an<br /> implementation for a practical problem.<br /> <br /> The practical work should be performed in groups of two students throughout the semester with regular updates on the progress.<br /> <br /> The lecture will be on Tuesday DS1 and the tutorials and practical sessions on Thursday DS1. Please check the concrete schedule for changes.<br /> <br /> &lt;!--'''The number of participants is limited to 20 students.--&gt; <br /> '''The course is full, no furhter registrations will be accepted.'''<br /> &lt;!--To register send an [mailto:sarah.gaggl@tu-dresden.de?Subject=PSSAI%20WS2019%20&amp;body=Your%20Text e-mail].'''--&gt;<br /> |Literature=*Stuart J. Russell and Peter Norvig. &quot;Artificial Intelligence A Modern Approach&quot; (3. edition ). Pearson Education, 2010.<br /> *Zbigniew Michalewicz and David B. Fogel. &quot;How to Solve It: Modern Heuristics&quot;, volume 2. Springer, 2004.<br /> *Martin Gebser, Benjamin Kaufmann Roland Kaminski, and Torsten Schaub. &quot;Answer Set Solving in Practice&quot;. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, 2012.<br /> *Michael Gelfond and Vladimir Lifschitz. &quot;Classical negation in logic programs and disjunctive databases&quot;. New Generation Comput., 9(3–4):365–386, 1991.<br /> *A.E. Eiben and J.E. Smith. &quot;Introduction to Evolutionary Computing&quot;, Springer, 2003.<br /> *Thomas Hammerl, Nysret Musliu and Werner Schafhauser. &quot;Metaheuristic Algorithms and Tree Decomposition&quot;, Handbook of Computational Intelligence, pp 1255–1270, Springer, 2015.<br /> *Hans L. Bodlaender, Arie M.C.A. Koster. &quot;Treewidth computations I. Upper bounds&quot;, Comput. 208(2): 259–275, 2010.<br /> *Georg Gottlob, Nicola Leone, and Francesco Scarcello. &quot;Hypertree decompositions and tractable queries&quot;, Journal of Computer and System Sciences, 64(3):579–627, 2002. ISSN 0022-0000.<br /> *Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, and Marko Samer. &quot;Heuristic methods for hypertree decomposition&quot;, In Alexander Gelbukh and Eduardo F. Morales, editors, MICAI 2008: Advances in Artificial Intelligence, volume 5317 of LNCS, pages 1–11. Springer Berlin Heidelberg, 2008. ISBN 978-3-540-88635-8.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/15<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Informed vs. Uninformed Search<br /> |Room=APB E005<br /> |Date=2019/10/22<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Topic<br /> |Room=APB E005<br /> |Date=2019/10/24<br /> |DS=DS1<br /> |Download=PSSAIWS2019 PA.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Search<br /> |Room=APB E005<br /> |Date=2019/10/29<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 1 (Local Search)<br /> |Room=APB E005<br /> |Date=2019/11/07<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tabu Search<br /> |Room=APB E005<br /> |Date=2019/11/12<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 1<br /> |Room=APB E005<br /> |Date=2019/11/14<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 2 (Tabu Search)<br /> |Room=APB E005<br /> |Date=2019/11/19<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 3 (ASP 1)<br /> |Room=APB E005<br /> |Date=2019/11/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 2<br /> |Room=APB E005<br /> |Date=2019/11/26<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L6+7.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Discussion<br /> |Room=APB E005<br /> |Date=2019/11/28<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 3<br /> |Room=APB E005<br /> |Date=2019/12/03<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 4 (ASP 2)<br /> |Room=APB E005<br /> |Date=2019/12/05<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP<br /> |Room=APB E005<br /> |Date=2019/12/10<br /> |DS=DS1<br /> |Download=PSSAI201920 L8.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 5 (CSP)<br /> |Room=APB E005<br /> |Date=2019/12/19<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T5.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Evolutionary Algorithms<br /> |Room=APB E005<br /> |Date=2019/12/17<br /> |DS=DS1<br /> |Download=PSSAI201920 L9.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 1<br /> |Room=APB E005<br /> |Date=2020/01/07<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 2<br /> |Room=APB E005<br /> |Date=2020/01/14<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 6 (Structural Decompositions)<br /> |Room=APB E005<br /> |Date=2020/01/16<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/23<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/01/28<br /> |DS=DS1<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:PSSAI-WS19-T5.pdf&diff=29925 2019-12-18T09:13:40Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Constraint_Programming_(WS2019)&diff=29917 2019-12-16T13:48:05Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Constraint Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-LCP<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== News ==<br /> * 1st Exercise Sheet is online<br /> <br /> == Description ==<br /> Many natural computation problems can be formulated as constraint satisfaction problems: given a finite set of variables and a finite set of constraints, the question is whether there is a solution that satisfies all conditions. For which types of constraints can CSPs be solved efficiently, and with which algorithms? For which CSPs can such algorithms not exist?<br /> |Literature=* Krzysztof Apt. Constraint Programming, Cambridge University Press. 2003.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS6<br /> |Download=FCP-L1-Introduction.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS6<br /> |Download=FCP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP in a Nutshell<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS6<br /> |Download=FCP-L2-CP in a Nutshell.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS6<br /> |Download=FCP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS6<br /> |Download=FCP-L3-Complete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS6<br /> |Download=FCP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Consistency<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS6<br /> |Download=FCP-L4-Local Consistency.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS6<br /> |Download=FCP2019-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Incomplete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS6<br /> |Download=FCP-L5-Incomplete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS6<br /> |Download=FCP2019-T5.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Constraint Propagation<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS6<br /> |Download=FCP-L6-Constraint Propagation.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Search<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS6<br /> |Download=FCP-L7-Search.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/30<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS6<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FCP2019-T5.pdf&diff=29916 2019-12-16T13:48:02Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Problem_Solving_and_Search_in_Artificial_Intelligence_(WS2019)&diff=29852 2019-12-05T08:02:13Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Problem Solving and Search in Artificial Intelligence<br /> |Research group=Computational Logic<br /> |Lecturers=Sarah Alice Gaggl<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-KR, MCL-PI<br /> |SWSLecture=2<br /> |SWSExercise=1<br /> |SWSPractical=2<br /> |Exam type=mündliche Prüfung<br /> |Description=Problem solving and search is a central topic in Artificial Intelligence. This course presents several techniques to solve in general difficult problems.<br /> <br /> The course covers the following '''topics''':<br /> *Basic Concepts<br /> *Uninformed vs Informed Search<br /> *Local Search, Stochastic Hill Climbing, Simulated Annealing<br /> *Tabu Search<br /> *Answer Set Programming<br /> *Constraint Satisfaction<br /> *Evolutionary Algorithms, Genetic Algorithms<br /> *Structural Decomposition Techniques (Tree/Hypertree Decompositions)<br /> <br /> <br /> ===Learning Outcomes===<br /> *The students should identify why typical AI problems are difficult to solve<br /> *The students will analyze different algorithms and methods for AI problems and identify when their application is appropriate <br /> *The connections between the (graph) structure and the complexity of a problem should become clear, as well as which methods can be used to tackle the problem<br /> *In the practical part, the students will analyze a given problem and develop a solution for it. <br /> <br /> ===Prerequisites===<br /> Basic knowledge of theoretical computer science and Logic.<br /> <br /> ===Organisation===<br /> The goals can be acquierd by studying the lecture material, solving the exercises of the tutorials and developing an<br /> implementation for a practical problem.<br /> <br /> The practical work should be performed in groups of two students throughout the semester with regular updates on the progress.<br /> <br /> The lecture will be on Tuesday DS1 and the tutorials and practical sessions on Thursday DS1. Please check the concrete schedule for changes.<br /> <br /> &lt;!--'''The number of participants is limited to 20 students.--&gt; <br /> '''The course is full, no furhter registrations will be accepted.'''<br /> &lt;!--To register send an [mailto:sarah.gaggl@tu-dresden.de?Subject=PSSAI%20WS2019%20&amp;body=Your%20Text e-mail].'''--&gt;<br /> |Literature=*Stuart J. Russell and Peter Norvig. &quot;Artificial Intelligence A Modern Approach&quot; (3. edition ). Pearson Education, 2010.<br /> *Zbigniew Michalewicz and David B. Fogel. &quot;How to Solve It: Modern Heuristics&quot;, volume 2. Springer, 2004.<br /> *Martin Gebser, Benjamin Kaufmann Roland Kaminski, and Torsten Schaub. &quot;Answer Set Solving in Practice&quot;. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, 2012.<br /> *Michael Gelfond and Vladimir Lifschitz. &quot;Classical negation in logic programs and disjunctive databases&quot;. New Generation Comput., 9(3–4):365–386, 1991.<br /> *A.E. Eiben and J.E. Smith. &quot;Introduction to Evolutionary Computing&quot;, Springer, 2003.<br /> *Thomas Hammerl, Nysret Musliu and Werner Schafhauser. &quot;Metaheuristic Algorithms and Tree Decomposition&quot;, Handbook of Computational Intelligence, pp 1255–1270, Springer, 2015.<br /> *Hans L. Bodlaender, Arie M.C.A. Koster. &quot;Treewidth computations I. Upper bounds&quot;, Comput. 208(2): 259–275, 2010.<br /> *Georg Gottlob, Nicola Leone, and Francesco Scarcello. &quot;Hypertree decompositions and tractable queries&quot;, Journal of Computer and System Sciences, 64(3):579–627, 2002. ISSN 0022-0000.<br /> *Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, and Marko Samer. &quot;Heuristic methods for hypertree decomposition&quot;, In Alexander Gelbukh and Eduardo F. Morales, editors, MICAI 2008: Advances in Artificial Intelligence, volume 5317 of LNCS, pages 1–11. Springer Berlin Heidelberg, 2008. ISBN 978-3-540-88635-8.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/15<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Informed vs. Uninformed Search<br /> |Room=APB E005<br /> |Date=2019/10/22<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Topic<br /> |Room=APB E005<br /> |Date=2019/10/24<br /> |DS=DS1<br /> |Download=PSSAIWS2019 PA.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Search<br /> |Room=APB E005<br /> |Date=2019/10/29<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 1 (Local Search)<br /> |Room=APB E005<br /> |Date=2019/11/07<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tabu Search<br /> |Room=APB E005<br /> |Date=2019/11/12<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 1<br /> |Room=APB E005<br /> |Date=2019/11/14<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 2 (Tabu Search)<br /> |Room=APB E005<br /> |Date=2019/11/19<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 3 (ASP 1)<br /> |Room=APB E005<br /> |Date=2019/11/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 2<br /> |Room=APB E005<br /> |Date=2019/11/26<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L6+7.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Discussion<br /> |Room=APB E005<br /> |Date=2019/11/28<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 3<br /> |Room=APB E005<br /> |Date=2019/12/03<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 4 (ASP 2)<br /> |Room=APB E005<br /> |Date=2019/12/05<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP<br /> |Room=APB E005<br /> |Date=2019/12/10<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 5 (CSP)<br /> |Room=APB E005<br /> |Date=2019/12/19<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Evolutionary Algorithms<br /> |Room=APB E005<br /> |Date=2019/12/17<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 1<br /> |Room=APB E005<br /> |Date=2020/01/07<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 2<br /> |Room=APB E005<br /> |Date=2020/01/14<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 6 (Structural Decompositions)<br /> |Room=APB E005<br /> |Date=2020/01/16<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/23<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/01/28<br /> |DS=DS1<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Problem_Solving_and_Search_in_Artificial_Intelligence_(WS2019)&diff=29846 2019-12-04T08:47:19Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Problem Solving and Search in Artificial Intelligence<br /> |Research group=Computational Logic<br /> |Lecturers=Sarah Alice Gaggl<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-KR, MCL-PI<br /> |SWSLecture=2<br /> |SWSExercise=1<br /> |SWSPractical=2<br /> |Exam type=mündliche Prüfung<br /> |Description=Problem solving and search is a central topic in Artificial Intelligence. This course presents several techniques to solve in general difficult problems.<br /> <br /> The course covers the following '''topics''':<br /> *Basic Concepts<br /> *Uninformed vs Informed Search<br /> *Local Search, Stochastic Hill Climbing, Simulated Annealing<br /> *Tabu Search<br /> *Answer Set Programming<br /> *Constraint Satisfaction<br /> *Evolutionary Algorithms, Genetic Algorithms<br /> *Structural Decomposition Techniques (Tree/Hypertree Decompositions)<br /> <br /> <br /> ===Learning Outcomes===<br /> *The students should identify why typical AI problems are difficult to solve<br /> *The students will analyze different algorithms and methods for AI problems and identify when their application is appropriate <br /> *The connections between the (graph) structure and the complexity of a problem should become clear, as well as which methods can be used to tackle the problem<br /> *In the practical part, the students will analyze a given problem and develop a solution for it. <br /> <br /> ===Prerequisites===<br /> Basic knowledge of theoretical computer science and Logic.<br /> <br /> ===Organisation===<br /> The goals can be acquierd by studying the lecture material, solving the exercises of the tutorials and developing an<br /> implementation for a practical problem.<br /> <br /> The practical work should be performed in groups of two students throughout the semester with regular updates on the progress.<br /> <br /> The lecture will be on Tuesday DS1 and the tutorials and practical sessions on Thursday DS1. Please check the concrete schedule for changes.<br /> <br /> &lt;!--'''The number of participants is limited to 20 students.--&gt; <br /> '''The course is full, no furhter registrations will be accepted.'''<br /> &lt;!--To register send an [mailto:sarah.gaggl@tu-dresden.de?Subject=PSSAI%20WS2019%20&amp;body=Your%20Text e-mail].'''--&gt;<br /> |Literature=*Stuart J. Russell and Peter Norvig. &quot;Artificial Intelligence A Modern Approach&quot; (3. edition ). Pearson Education, 2010.<br /> *Zbigniew Michalewicz and David B. Fogel. &quot;How to Solve It: Modern Heuristics&quot;, volume 2. Springer, 2004.<br /> *Martin Gebser, Benjamin Kaufmann Roland Kaminski, and Torsten Schaub. &quot;Answer Set Solving in Practice&quot;. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, 2012.<br /> *Michael Gelfond and Vladimir Lifschitz. &quot;Classical negation in logic programs and disjunctive databases&quot;. New Generation Comput., 9(3–4):365–386, 1991.<br /> *A.E. Eiben and J.E. Smith. &quot;Introduction to Evolutionary Computing&quot;, Springer, 2003.<br /> *Thomas Hammerl, Nysret Musliu and Werner Schafhauser. &quot;Metaheuristic Algorithms and Tree Decomposition&quot;, Handbook of Computational Intelligence, pp 1255–1270, Springer, 2015.<br /> *Hans L. Bodlaender, Arie M.C.A. Koster. &quot;Treewidth computations I. Upper bounds&quot;, Comput. 208(2): 259–275, 2010.<br /> *Georg Gottlob, Nicola Leone, and Francesco Scarcello. &quot;Hypertree decompositions and tractable queries&quot;, Journal of Computer and System Sciences, 64(3):579–627, 2002. ISSN 0022-0000.<br /> *Artan Dermaku, Tobias Ganzow, Georg Gottlob, Ben McMahan, Nysret Musliu, and Marko Samer. &quot;Heuristic methods for hypertree decomposition&quot;, In Alexander Gelbukh and Eduardo F. Morales, editors, MICAI 2008: Advances in Artificial Intelligence, volume 5317 of LNCS, pages 1–11. Springer Berlin Heidelberg, 2008. ISBN 978-3-540-88635-8.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/15<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Informed vs. Uninformed Search<br /> |Room=APB E005<br /> |Date=2019/10/22<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Topic<br /> |Room=APB E005<br /> |Date=2019/10/24<br /> |DS=DS1<br /> |Download=PSSAIWS2019 PA.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Search<br /> |Room=APB E005<br /> |Date=2019/10/29<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 1 (Local Search)<br /> |Room=APB E005<br /> |Date=2019/11/07<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Tabu Search<br /> |Room=APB E005<br /> |Date=2019/11/12<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L4.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 1<br /> |Room=APB E005<br /> |Date=2019/11/14<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L5.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 2 (Tabu Search)<br /> |Room=APB E005<br /> |Date=2019/11/19<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 3 (ASP 1)<br /> |Room=APB E005<br /> |Date=2019/11/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 2<br /> |Room=APB E005<br /> |Date=2019/11/26<br /> |DS=DS1<br /> |Download=PSSAIWS2019 L6+7.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Discussion<br /> |Room=APB E005<br /> |Date=2019/11/28<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP 3<br /> |Room=APB E005<br /> |Date=2019/12/03<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 4 (ASP 2)<br /> |Room=APB E005<br /> |Date=2019/12/05<br /> |DS=DS1<br /> |Download=PSSAI-WS19-T4.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP<br /> |Room=APB E005<br /> |Date=2019/12/10<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 5 (CSP)<br /> |Room=APB E005<br /> |Date=2019/12/12<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Evolutionary Algorithms<br /> |Room=APB E005<br /> |Date=2019/12/17<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 1<br /> |Room=APB E005<br /> |Date=2020/01/07<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Structural Decompositions 2<br /> |Room=APB E005<br /> |Date=2020/01/14<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial 6 (Structural Decompositions)<br /> |Room=APB E005<br /> |Date=2020/01/16<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/21<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Praktikum<br /> |Title=Practical Work Presentations<br /> |Room=APB E005<br /> |Date=2020/01/23<br /> |DS=DS1<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/01/28<br /> |DS=DS1<br /> }}</div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:PSSAI-WS19-T4.pdf&diff=29845 2019-12-04T08:47:17Z

<p>Lukas Schweizer: </p> <hr /> <div></div>

Lukas Schweizer https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Constraint_Programming_(WS2019)&diff=29800 2019-11-29T14:03:37Z

<p>Lukas Schweizer: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Constraint Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Lukas Schweizer<br /> |Term=WS<br /> |Year=2019<br /> |Module=INF-BAS2, INF-VERT2, MCL-LCP<br /> |SWSLecture=1<br /> |SWSExercise=1<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=== News ==<br /> * 1st Exercise Sheet is online<br /> <br /> == Description ==<br /> Many natural computation problems can be formulated as constraint satisfaction problems: given a finite set of variables and a finite set of constraints, the question is whether there is a solution that satisfies all conditions. For which types of constraints can CSPs be solved efficiently, and with which algorithms? For which CSPs can such algorithms not exist?<br /> |Literature=* Krzysztof Apt. Constraint Programming, Cambridge University Press. 2003.<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Introduction<br /> |Room=APB E005<br /> |Date=2019/10/14<br /> |DS=DS6<br /> |Download=FCP-L1-Introduction.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/10/21<br /> |DS=DS6<br /> |Download=FCP2019-T1.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=CSP in a Nutshell<br /> |Room=APB E005<br /> |Date=2019/10/28<br /> |DS=DS6<br /> |Download=FCP-L2-CP in a Nutshell.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/04<br /> |DS=DS6<br /> |Download=FCP2019-T2.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Complete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/11/11<br /> |DS=DS6<br /> |Download=FCP-L3-Complete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/11/18<br /> |DS=DS6<br /> |Download=FCP2019-T3.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Local Consistency<br /> |Room=APB E005<br /> |Date=2019/11/25<br /> |DS=DS6<br /> |Download=FCP-L4-Local Consistency.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/02<br /> |DS=DS6<br /> |Download=FCP2019-T4.pdf,<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Incomplete Constraint Solvers<br /> |Room=APB E005<br /> |Date=2019/12/09<br /> |DS=DS6<br /> |Download=FCP-L5-Incomplete Constraint Solvers.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2019/12/16<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Constraint Propagation<br /> |Room=APB E005<br /> |Date=2020/01/06<br /> |DS=DS6<br /> |Download=FCP-L6-Constraint Propagation.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/13<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Search<br /> |Room=APB E005<br /> |Date=2020/01/20<br /> |DS=DS6<br /> |Download=FCP-L7-Search.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Tutorial<br /> |Room=APB E005<br /> |Date=2020/01/30<br /> |DS=DS6<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2020/02/03<br /> |DS=DS6<br /> }}</div>

Lukas Schweizer