https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Hannes+Stra%C3%9F 2026-04-17T10:17:00Z Benutzerbeiträge MediaWiki 1.43.1 https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44304 2026-04-17T10:06:39Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Normal-Form Games: Mixed Strategies<br /> |Room=BEY/E39/U<br /> |Date=2026-04-20<br /> |DS=DS3<br /> |Download=AGT2026-02.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-02.pdf&diff=44303 2026-04-17T10:06:31Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44280 2026-04-14T08:14:12Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Übung<br /> |Title=Exercises 1<br /> |Room=APB<br /> |Date=2026-04-16<br /> |DS=terminlos<br /> |Download=AGT2026-Problems-01.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-Problems-01.pdf&diff=44279 2026-04-14T08:13:53Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44274 2026-04-13T13:21:53Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> |Download=AGT2026-01.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:AGT2026-01.pdf&diff=44273 2026-04-13T13:21:48Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3450&diff=44215 2026-03-20T13:12:54Z

<p>Hannes Straß: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Piotr<br /> |ErsterAutorNachname=Gorczyca<br /> |FurtherAuthors=Hannes Straß<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Non-Monotonic S4F Standpoint Logic<br /> |To appear=0<br /> |Year=2026<br /> |Month=Januar<br /> |Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26)<br /> |Pages=19126–19134<br /> |Volume=40 (23)<br /> }}<br /> {{Publikation Details<br /> |Abstract=Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics — in particular using the modal logic S4F.<br /> In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and propositional standpoint logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.<br /> |Download=Gorczyca-strass2025non-monotonic-s4f-standpoint-logic.pdf<br /> |Slides=Gorczyca-strass-aaai-2026.pdf<br /> |Link=https://doi.org/10.1609/aaai.v40i23.38986<br /> |DOI Name=10.1609/aaai.v40i23.38986<br /> |Projekt=KIMEDS<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> Access the live presentation at https://cl-tud.github.io/talks/2026/aaai/non-mon-s4f-standpoint-logic</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44209 2026-03-19T13:51:09Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered as follows:<br /> <br /> * Thursdays, DS2, APB/E007<br /> * Thursdays, DS4, APB/E001<br /> * Thursdays, DS5, APB/E006<br /> * Fridays, DS2, APB/E001<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS/Erasmus students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44102 2026-03-02T15:02:02Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered at the following times:<br /> <br /> * Thursdays, DS2<br /> * Thursdays, DS4,<br /> * Thursdays, DS5,<br /> * Fridays, DS2.<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44101 2026-03-02T15:01:31Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered at the following times:<br /> <br /> * Thursdays, DS2<br /> * Thursdays, DS4,<br /> * Thursdays, DS5,<br /> * Fridays, DS2.<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de&amp;subject=&quot;Exam date Algorithmic Game Theory&quot; the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44100 2026-03-02T15:00:35Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered at the following times:<br /> <br /> * Thursdays, DS2<br /> * Thursdays, DS4,<br /> * Thursdays, DS5,<br /> * Fridays, DS2.<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL group's secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44099 2026-03-02T15:00:01Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered at the following times:<br /> <br /> * Thursdays, DS2<br /> * Thursdays, DS4,<br /> * Thursdays, DS5,<br /> * Fridays, DS2.<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL groups secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-13<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44098 2026-03-02T14:59:47Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, [https://navigator.tu-dresden.de/etplan/bey/00/raum/111100.5500 BEY/E39/U]<br /> <br /> Exercise sessions are offered at the following times:<br /> <br /> * Thursdays, DS2<br /> * Thursdays, DS4,<br /> * Thursdays, DS5,<br /> * Fridays, DS2.<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL groups secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-02<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Algorithmic_Game_Theory_(SS2026)&diff=44096 2026-03-02T14:58:19Z

<p>Hannes Straß: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Algorithmic Game Theory |Research group=Computational Logic |Lecturers=Hannes Straß |Tutors=Sarah Alice Gaggl |Term=SS |Year=2026 |Module=INF-B-510, INF-B-520, INF-PM-FOR |SWSLecture=2 |SWSExercise=2 |SWSPractical=0 |Exam type=Klausur, mündliche Prüfung |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed. In t…“</p> <hr /> <div>{{Vorlesung<br /> |Title=Algorithmic Game Theory<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Tutors=Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2026<br /> |Module=INF-B-510, INF-B-520, INF-PM-FOR<br /> |SWSLecture=2<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur, mündliche Prüfung<br /> |Description=Game Theory is a multi-disciplinary and pervasive field that is concerned with how strategic decision making can be formally modelled and mathematically analysed.<br /> <br /> In this course, we will approach the subject from a computer science perspective and – in addition to covering the foundational aspects – also address how game theory can be approached computationally, e.g. consider how computers can be programmed to play games, or analyse the computational complexity of various game-theoretic notions.<br /> <br /> === Dates and times ===<br /> <br /> The lecture takes place as follows:<br /> <br /> * Mondays, DS3, BEY/E39/U<br /> <br /> Exercise sessions are offered at the following times:<br /> <br /> * Thursdays, DS2<br /> * Thursdays, DS4,<br /> * Thursdays, DS5,<br /> * Fridays, DS2.<br /> <br /> Exercises start in the week of the first lecture, i.e. on 16th April.<br /> <br /> === Topics ===<br /> <br /> * Noncooperative games in normal form<br /> * Noncooperative games in extensive form<br /> * Search in game trees<br /> * Games with missing information<br /> * Evolutionary game theory<br /> * The Game Description Language and General Game Playing<br /> * Cooperative Games<br /> <br /> === Exam ===<br /> <br /> For CMS students and students wishing to use this course for modules INF-B-510 or INF-B-520, there will be a written exam (90min). The exam will be closed book, i.e. without notes, and no other resources (in particular technical aids) are permitted.<br /> <br /> For anyone else (INF-VERT-2/6, INF-BAS-2/6, INF-PM-FOR, IST) the exam will be oral. To obtain an exam slot, please contact [mailto:cl@tu-dresden.de the CL groups secretary].<br /> |Literature=* Jörg Rothe (Ed.): Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer-Verlag Berlin Heidelberg (2016) (Part I: Playing Successfully)<br /> ** Lectures 1, 2, 6, 7, 12, and 13<br /> <br /> * Richard Alan Gillman, David Housman: Game Theory. A Modeling Approach. CRC Press (2019)<br /> ** Lectures 1, 2, 4, and 10<br /> <br /> * Stuart J. Russell, Peter Norvig: Artificial Intelligence. A Modern Approach (Global Edition). Pearson (2021) (Chapter 6: Adversarial Search and Games)<br /> ** Lectures 5 and 6<br /> <br /> * Todd W. Neller, Marc Lanctot: An Introduction to Counterfactual Regret Minimization. Self-published. (2013)<br /> ** Lecture 9<br /> <br /> * Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay Vazirani (eds.): Algorithmic Game Theory. Cambridge University Press (2007)<br /> ** Lecture 10<br /> <br /> * Michael R. Genesereth, Michael Thielscher: General Game Playing (Synthesis Lectures on Artificial Intelligence and Machine Learning) Morgan &amp; Claypool Publishers (2014)<br /> ** Lectures 5, 6, and 11<br /> <br /> * Bernhard von Stengel: Game Theory Basics. Cambridge University Press (2021)<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Noncooperative Games in Normal Form<br /> |Room=BEY/E39/U<br /> |Date=2026-04-02<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43832 2026-01-06T14:12:08Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> |Download=FLP2025-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> |Download=FLP2025-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> |Download=FLP2025-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> |Download=FLP2025-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> |Download=FLP2025-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> |Download=FLP2025-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> |Download=FLP2025-12.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-12.pdf&diff=43831 2026-01-06T14:12:06Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43815 2026-01-05T10:06:55Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> |Download=FLP2025-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> |Download=FLP2025-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> |Download=FLP2025-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> |Download=FLP2025-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> |Download=FLP2025-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> |Download=FLP2025-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-11.pdf&diff=43814 2026-01-05T10:06:49Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-10.pdf&diff=43763 2025-12-15T10:01:09Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:FLP2025-10.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43751 2025-12-12T15:16:35Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> |Download=FLP2025-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> |Download=FLP2025-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> |Download=FLP2025-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> |Download=FLP2025-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> |Download=FLP2025-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-10.pdf&diff=43750 2025-12-12T15:16:31Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-09.pdf&diff=43721 2025-12-08T09:50:57Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:FLP2025-09.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43691 2025-12-02T08:45:08Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> |Download=FLP2025-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> |Download=FLP2025-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> |Download=FLP2025-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> |Download=FLP2025-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-09.pdf&diff=43690 2025-12-02T08:44:57Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-08.pdf&diff=43685 2025-12-01T09:13:33Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:FLP2025-08.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43641 2025-11-25T09:04:50Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> |Download=FLP2025-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> |Download=FLP2025-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> |Download=FLP2025-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-08.pdf&diff=43640 2025-11-25T09:04:44Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43611 2025-11-21T08:10:32Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> |Download=FLP2025-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> |Download=FLP2025-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-07.pdf&diff=43610 2025-11-21T08:10:27Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43572 2025-11-14T13:02:00Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> |Download=FLP2025-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-06.pdf&diff=43571 2025-11-14T13:01:11Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Theoretische_Informatik_und_Logik_(SS2025)&diff=43533 2025-11-07T13:42:20Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Theoretische Informatik und Logik<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Hannes Straß; Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2025<br /> |Lecture series=Theoretische Informatik und Logik<br /> |Module=INF-B-290, INF-D-330<br /> |SWSLecture=4<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=Die Lehrveranstaltung vermittelt eine vertiefende Einleitung in die theoretische Informatik, beginnend mit den Grundlagen der Berechenbarkeits- und Komplexitätstheorie, Prädikatenlogik und deren Bezug zu Komplexität und Datenbanken, bis hin zu weiterführenden Themen wie Gödels Unvollständigkeitstheoreme und die Beziehung von Logik und formalen Sprachen.<br /> Wir stoßen vor zu den Grenzen der Informatik und Mathematik, treffen auf fleißige Biber und verrückte Logiker, vergleichen SQL mit Tic Tac Toe und stellen die großen Fragen unseres Fachgebiets.<br /> <br /> Die Vorlesung ist weitgehend selbsterklärend, aber Grundlagen aus der Veranstaltung [[Formale Systeme]] können hilfreich sein.<br /> <br /> == Prüfungseinsicht ==<br /> <br /> Eine Einsichtnahme in die Prüfungsklausur wurde am 20.10.2025 von 15:30 bis 17:00 Uhr im Raum APB/2040 angeboten.<br /> <br /> Eine weitere Einsichtnahme in die Prüfungsklausur wird am 17.11.2025 von 14:00 bis 15:00 Uhr im Raum APB/2040 angeboten. Bringen Sie bitte Ihren Studentenausweis mit.<br /> <br /> == Prüfung ==<br /> <br /> Die Prüfungsklausur findet am 13.08.2025 um 08:00 Uhr im Hörsaalzentrum statt. Die Raumaufteilung ist wie folgt:<br /> <br /> * Anfangsbuchstaben (Familienname) A–P: [https://navigator.tu-dresden.de/etplan/hsz/01/raum/136101.0400 HSZ/AUDI/H]<br /> * Anfangsbuchstaben (Familienname) Q–Z: [https://navigator.tu-dresden.de/raum/1361-1.0400 HSZ/0002/E]<br /> <br /> Zur Klausur sind keine Hilfsmittel zugelassen.<br /> <br /> == Vorlesungen ==<br /> <br /> Vorlesungstermine:<br /> <br /> * Mo 3. DS, [https://navigator.tu-dresden.de/raum/145403.0460 HÜL/S386/H]<br /> * Do 4. DS, [https://navigator.tu-dresden.de/raum/1361-1.0400 HSZ/0002/E]<br /> <br /> == Übungen ==<br /> <br /> Die Einschreibung in die Übungsgruppen erfolgt über die [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48851910659/CourseNode/101413613647390?20 OPAL-Seite der Lehrveranstaltung] '''ab 07.04.2025 15:00 Uhr'''.<br /> Für die Teilnahme an einer Übungsgruppe ist die Einschreibung in dieser Gruppe '''verpflichtend'''.<br /> Studierenden ohne Einschreibung kann die Teilnahme an einer selbstgewählten Übung nicht garantiert werden.<br /> Übungsleiter:innen sind berechtigt, nicht eingeschriebene Studierende bei Überfüllung aus der (digitalen) Übung zu verweisen.<br /> <br /> Übungsgruppen finden am 14. April 2025 sowie ab dem 22. April 2025 zu ihren jeweiligen Terminen statt.<br /> Übungsblätter gibt es im [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48851910659/CourseNode/101413613647390?20 OPAL].<br /> <br /> '''Individuelles Feedback für Ihre Lösungen:''' Als zusätzliche Hilfe bieten wir in diesem Semester an, von Studierenden eingereichte Lösungsansätze zu sichten und Ihnen dazu eine Rückmeldung zu geben.<br /> Die Details (Abgabetermin &amp; Umfang) werden von den Tutor:innen festgelegt. Unterlagen können per E-Mail an die Tutor:innen abgegeben werden (als digitales Dokument, egal ob Handyfoto der eigenen Handschrift oder am Computer geschriebener Text).<br /> <br /> == Kontakt ==<br /> <br /> Zur Kommunikation unter Vorlesungsteilnehmer:innen der TU Dresden stehen ein OPAL-Diskussionsforum zur Verfügung.<br /> <br /> Persönliche Fragen können auch direkt an das Organisationsteam (siehe Links oben) gestellt werden, falls sie aus einem zwingenden Grund nicht über andere Kanäle gerichtet werden können.<br /> Allgemeine Fragen sollten Sie aber immer in geteilten Kanälen stellen, damit auch Ihre Kommiliton:innen davon profitieren (oder vielleicht sogar direkt helfen können).<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=1. Vorlesung: Willkommen und Einleitung<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-07<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=2. Vorlesung: Berechenbarkeit und Unentscheidbarkeit<br /> |Room=HSZ/0002/E<br /> |Date=2025-04-10<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=3. Vorlesung: WHILE und LOOP<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-14<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=4. Vorlesung: Das Halteproblem und Reduktionen<br /> |Room=HSZ/0002/E<br /> |Date=2025-04-17<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Ostermontag<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-21<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=5. Vorlesung: Der Satz von Rice und das Postsche Korrespondenzproblem<br /> |Room=HSZ/0002/E<br /> |Date=2025-04-24<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=6. Vorlesung: Unentscheidbare Probleme formaler Sprachen<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-28<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=7. Vorlesung: Einführung in die Komplexitätstheorie<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-05<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=8. Vorlesung: Beziehungen zwischen Komplexitätsklassen / Effizient lösbare Probleme<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-08<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=9. Vorlesung: NP und NP-Vollständigkeit<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-12<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=10. Vorlesung: NP, Teil 2<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-15<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=11. Vorlesung: NL und PSpace<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-19<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=12. Vorlesung: PSpace-Vollständigkeit<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-22<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-12.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=13. Vorlesung: Prädikatenlogik: Syntax und Semantik<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-26<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-13.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=14. Vorlesung: Modelltheorie und logisches Schließen<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-02<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-14.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=1. Mai<br /> |Room=APB<br /> |Date=2025-05-01<br /> |DS=DS4<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Himmelfahrt<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-29<br /> |DS=DS4<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=15. Vorlesung: Logisches Schließen und Gleichheit<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-05<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-15.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pfingsten<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-09<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pfingsten<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-12<br /> |DS=DS4<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=16. Vorlesung: Logisches Schließen – Unentscheidbarkeit<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-16<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-16.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=17. Vorlesung: Funktionen und Normalformen<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-19<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-17.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=18. Vorlesung: Unifikation<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-23<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-18.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=19. Vorlesung: Resolution<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-26<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-19.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=20. Vorlesung: Resolution (2)<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-30<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-20.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=21. Vorlesung: Endliche Interpretationen und Datenbanken<br /> |Room=HSZ/0002/E<br /> |Date=2025-07-03<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-21.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=22. Vorlesung: Datalog<br /> |Room=HÜL/S386/H<br /> |Date=2025-07-07<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-22.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=23. Vorlesung: Gödels 1. Unvollständigkeitssatz<br /> |Room=HSZ/0002/E<br /> |Date=2025-07-10<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-23.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=24. Vorlesung: Gödel, Turing und der ganze Rest<br /> |Room=HÜL/S386/H<br /> |Date=2025-07-14<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-24.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43532 2025-11-07T09:58:27Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> |Download=FLP2025-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Happy Holidays!<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Konsultation<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-05.pdf&diff=43531 2025-11-07T09:58:19Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43476 2025-11-03T10:01:19Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> |Download=FLP2025-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Happy Holidays!<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Konsultation<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-04.pdf&diff=43475 2025-11-03T10:01:07Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-03.pdf&diff=43420 2025-10-27T09:35:11Z

<p>Hannes Straß: Hannes Straß lud eine neue Version von Datei:FLP2025-03.pdf hoch</p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43414 2025-10-24T13:28:09Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> |Download=FLP2025-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Happy Holidays!<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Konsultation<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-03.pdf&diff=43413 2025-10-24T13:28:05Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43355 2025-10-20T08:09:58Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> |Download=FLP2025-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Happy Holidays!<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Konsultation<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-02.pdf&diff=43354 2025-10-20T08:09:53Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Theoretische_Informatik_und_Logik_(SS2025)&diff=43295 2025-10-13T08:09:16Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Theoretische Informatik und Logik<br /> |Research group=Computational Logic<br /> |Lecturers=Sebastian Rudolph<br /> |Tutors=Hannes Straß; Sarah Alice Gaggl<br /> |Term=SS<br /> |Year=2025<br /> |Lecture series=Theoretische Informatik und Logik<br /> |Module=INF-B-290, INF-D-330<br /> |SWSLecture=4<br /> |SWSExercise=2<br /> |SWSPractical=0<br /> |Exam type=Klausur<br /> |Description=Die Lehrveranstaltung vermittelt eine vertiefende Einleitung in die theoretische Informatik, beginnend mit den Grundlagen der Berechenbarkeits- und Komplexitätstheorie, Prädikatenlogik und deren Bezug zu Komplexität und Datenbanken, bis hin zu weiterführenden Themen wie Gödels Unvollständigkeitstheoreme und die Beziehung von Logik und formalen Sprachen.<br /> Wir stoßen vor zu den Grenzen der Informatik und Mathematik, treffen auf fleißige Biber und verrückte Logiker, vergleichen SQL mit Tic Tac Toe und stellen die großen Fragen unseres Fachgebiets.<br /> <br /> Die Vorlesung ist weitgehend selbsterklärend, aber Grundlagen aus der Veranstaltung [[Formale Systeme]] können hilfreich sein.<br /> <br /> == Prüfungseinsicht ==<br /> <br /> Eine Einsichtnahme in die Prüfungsklausur wird am 20.10.2025 von 15:30 bis 17:00 Uhr im Raum APB/2040 angeboten. Bringen Sie bitte Ihren Studentenausweis mit.<br /> <br /> == Prüfung ==<br /> <br /> Die Prüfungsklausur findet am 13.08.2025 um 08:00 Uhr im Hörsaalzentrum statt. Die Raumaufteilung ist wie folgt:<br /> <br /> * Anfangsbuchstaben (Familienname) A–P: [https://navigator.tu-dresden.de/etplan/hsz/01/raum/136101.0400 HSZ/AUDI/H]<br /> * Anfangsbuchstaben (Familienname) Q–Z: [https://navigator.tu-dresden.de/raum/1361-1.0400 HSZ/0002/E]<br /> <br /> Zur Klausur sind keine Hilfsmittel zugelassen.<br /> <br /> == Vorlesungen ==<br /> <br /> Vorlesungstermine:<br /> <br /> * Mo 3. DS, [https://navigator.tu-dresden.de/raum/145403.0460 HÜL/S386/H]<br /> * Do 4. DS, [https://navigator.tu-dresden.de/raum/1361-1.0400 HSZ/0002/E]<br /> <br /> == Übungen ==<br /> <br /> Die Einschreibung in die Übungsgruppen erfolgt über die [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48851910659/CourseNode/101413613647390?20 OPAL-Seite der Lehrveranstaltung] '''ab 07.04.2025 15:00 Uhr'''.<br /> Für die Teilnahme an einer Übungsgruppe ist die Einschreibung in dieser Gruppe '''verpflichtend'''.<br /> Studierenden ohne Einschreibung kann die Teilnahme an einer selbstgewählten Übung nicht garantiert werden.<br /> Übungsleiter:innen sind berechtigt, nicht eingeschriebene Studierende bei Überfüllung aus der (digitalen) Übung zu verweisen.<br /> <br /> Übungsgruppen finden am 14. April 2025 sowie ab dem 22. April 2025 zu ihren jeweiligen Terminen statt.<br /> Übungsblätter gibt es im [https://bildungsportal.sachsen.de/opal/auth/RepositoryEntry/48851910659/CourseNode/101413613647390?20 OPAL].<br /> <br /> '''Individuelles Feedback für Ihre Lösungen:''' Als zusätzliche Hilfe bieten wir in diesem Semester an, von Studierenden eingereichte Lösungsansätze zu sichten und Ihnen dazu eine Rückmeldung zu geben.<br /> Die Details (Abgabetermin &amp; Umfang) werden von den Tutor:innen festgelegt. Unterlagen können per E-Mail an die Tutor:innen abgegeben werden (als digitales Dokument, egal ob Handyfoto der eigenen Handschrift oder am Computer geschriebener Text).<br /> <br /> == Kontakt ==<br /> <br /> Zur Kommunikation unter Vorlesungsteilnehmer:innen der TU Dresden stehen ein OPAL-Diskussionsforum zur Verfügung.<br /> <br /> Persönliche Fragen können auch direkt an das Organisationsteam (siehe Links oben) gestellt werden, falls sie aus einem zwingenden Grund nicht über andere Kanäle gerichtet werden können.<br /> Allgemeine Fragen sollten Sie aber immer in geteilten Kanälen stellen, damit auch Ihre Kommiliton:innen davon profitieren (oder vielleicht sogar direkt helfen können).<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=1. Vorlesung: Willkommen und Einleitung<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-07<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=2. Vorlesung: Berechenbarkeit und Unentscheidbarkeit<br /> |Room=HSZ/0002/E<br /> |Date=2025-04-10<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-02.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=3. Vorlesung: WHILE und LOOP<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-14<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-03.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=4. Vorlesung: Das Halteproblem und Reduktionen<br /> |Room=HSZ/0002/E<br /> |Date=2025-04-17<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-04.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Ostermontag<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-21<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=5. Vorlesung: Der Satz von Rice und das Postsche Korrespondenzproblem<br /> |Room=HSZ/0002/E<br /> |Date=2025-04-24<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-05.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=6. Vorlesung: Unentscheidbare Probleme formaler Sprachen<br /> |Room=HÜL/S386/H<br /> |Date=2025-04-28<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-06.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=7. Vorlesung: Einführung in die Komplexitätstheorie<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-05<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-07.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=8. Vorlesung: Beziehungen zwischen Komplexitätsklassen / Effizient lösbare Probleme<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-08<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-08.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=9. Vorlesung: NP und NP-Vollständigkeit<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-12<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-09.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=10. Vorlesung: NP, Teil 2<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-15<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-10.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=11. Vorlesung: NL und PSpace<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-19<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-11.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=12. Vorlesung: PSpace-Vollständigkeit<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-22<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-12.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=13. Vorlesung: Prädikatenlogik: Syntax und Semantik<br /> |Room=HÜL/S386/H<br /> |Date=2025-05-26<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-13.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=14. Vorlesung: Modelltheorie und logisches Schließen<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-02<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-14.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=1. Mai<br /> |Room=APB<br /> |Date=2025-05-01<br /> |DS=DS4<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Himmelfahrt<br /> |Room=HSZ/0002/E<br /> |Date=2025-05-29<br /> |DS=DS4<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=15. Vorlesung: Logisches Schließen und Gleichheit<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-05<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-15.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pfingsten<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-09<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Pfingsten<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-12<br /> |DS=DS4<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=16. Vorlesung: Logisches Schließen – Unentscheidbarkeit<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-16<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-16.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=17. Vorlesung: Funktionen und Normalformen<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-19<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-17.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=18. Vorlesung: Unifikation<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-23<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-18.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=19. Vorlesung: Resolution<br /> |Room=HSZ/0002/E<br /> |Date=2025-06-26<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-19.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=20. Vorlesung: Resolution (2)<br /> |Room=HÜL/S386/H<br /> |Date=2025-06-30<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-20.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=21. Vorlesung: Endliche Interpretationen und Datenbanken<br /> |Room=HSZ/0002/E<br /> |Date=2025-07-03<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-21.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=22. Vorlesung: Datalog<br /> |Room=HÜL/S386/H<br /> |Date=2025-07-07<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-22.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=23. Vorlesung: Gödels 1. Unvollständigkeitssatz<br /> |Room=HSZ/0002/E<br /> |Date=2025-07-10<br /> |DS=DS4<br /> |Download=TheoLog2025-Vorlesung-23.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=24. Vorlesung: Gödel, Turing und der ganze Rest<br /> |Room=HÜL/S386/H<br /> |Date=2025-07-14<br /> |DS=DS3<br /> |Download=TheoLog2025-Vorlesung-24.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43264 2025-10-07T12:31:54Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Happy Holidays!<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2026-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2026-01-12<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2026-01-19<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Konsultation<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2026-01-26<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43263 2025-10-07T12:31:19Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Happy Holidays!<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Syntax and Semantics<br /> |Room=APB E005<br /> |Date=2025-01-05<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Language Extensions and Modelling<br /> |Room=APB E005<br /> |Date=2025-01-12<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=ASP: Characterisation and Computation<br /> |Room=APB E005<br /> |Date=2025-01-19<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Konsultation<br /> |Title=Q&amp;A<br /> |Room=APB E005<br /> |Date=2025-01-26<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43262 2025-10-07T12:29:01Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Soundness and “Completeness” of SLDNF Resolution<br /> |Room=APB E005<br /> |Date=2025-12-01<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Model Theory<br /> |Room=APB E005<br /> |Date=2025-12-08<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Entfällt<br /> |Title=Happy Holidays!<br /> |Room=APB E005<br /> |Date=2025-12-15<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43261 2025-10-07T12:26:49Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Least Herbrand Models<br /> |Room=APB E005<br /> |Date=2025-11-10<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Pure Prolog<br /> |Room=APB E005<br /> |Date=2025-11-17<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Negation: Proof Theory (SLDNF Resolution)<br /> |Room=APB E005<br /> |Date=2025-11-24<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43260 2025-10-07T12:25:15Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Unification<br /> |Room=APB E005<br /> |Date=2025-10-20<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-10-27<br /> |DS=DS3<br /> }}<br /> {{Vorlesung Zeiten<br /> |Lehrveranstaltungstype=Vorlesung<br /> |Title=Correctness of SLD Resolution<br /> |Room=APB E005<br /> |Date=2025-11-03<br /> |DS=DS3<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43259 2025-10-07T12:22:47Z

<p>Hannes Straß: </p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |Module=INF-BAS2, INF-BAS6, INF-VERT2, INF-VERT6, INF-25-Ma-FTK-ASAI, CMS-LM-BAS, CMS-LM-MOC<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> |Download=FLP2025-01.pdf<br /> }}</div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:FLP2025-01.pdf&diff=43258 2025-10-07T12:19:08Z

<p>Hannes Straß: </p> <hr /> <div></div>

Hannes Straß https://iccl.inf.tu-dresden.de/w/index.php?title=Foundations_of_Logic_Programming_(WS2025)&diff=43233 2025-10-01T11:40:37Z

<p>Hannes Straß: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Foundations of Logic Programming |Research group=Computational Logic |Lecturers=Hannes Straß |Term=WS |Year=2025 |SWSLecture=2 |SWSExercise=0 |SWSPractical=0 |Exam type=mündliche Prüfung |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic. This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declar…“</p> <hr /> <div>{{Vorlesung<br /> |Title=Foundations of Logic Programming<br /> |Research group=Computational Logic<br /> |Lecturers=Hannes Straß<br /> |Term=WS<br /> |Year=2025<br /> |SWSLecture=2<br /> |SWSExercise=0<br /> |SWSPractical=0<br /> |Exam type=mündliche Prüfung<br /> |Description=Logic Programming is a form of declarative programming that has its roots in first-order predicate logic.<br /> <br /> This introductory course covers the fundamental topics of logic programming such as the rule-based syntax, procedural and declarative semantics, the treatment of 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 /> <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=2025-10-13<br /> |DS=DS3<br /> }}</div>

Hannes Straß