Account
Edit tools
Internal
SucheSearch
Deutsch

New pages

From International Center for Computational Logic
New pages
Hide registered users | Hide bots | Show redirects

6 October 2026

  • 08:4908:49, 6 October 2026 HSZ 204 (hist | edit) [325 bytes] Maximilian Marx (talk | contribs) (Die Seite wurde neu angelegt: „{{Raum |Navigator URL=http://navigator.tu-dresden.de/etplan/hsz/02/raum/136102.0040 |Beschreibung DE=Dies ist einer der Seminarräume im zweiten Stock des Hörsaalzentrums. Er enthält etwa 60 Sitzplätze. |Beschreibung EN=This is one of the seminar rooms on the second floor of Hörsaalzentrum. It offers around 60 seats. }}“)
  • 08:4808:48, 6 October 2026 HSZ 304 (hist | edit) [326 bytes] Maximilian Marx (talk | contribs) (Die Seite wurde neu angelegt: „{{Raum |Navigator URL=http://navigator.tu-dresden.de/etplan/hsz/03/raum/136103.0040 |Beschreibung DE=Dies ist einer der Seminarräume im dritten Stock des Hörsaalzentrums. Er enthält etwa 100 Sitzplätze. |Beschreibung EN=This is one of the seminar rooms on the third floor of Hörsaalzentrum. It offers around 100 seats. }}“)
  • 06:2606:26, 6 October 2026 Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) (hist | edit) [1,030 bytes] Nils Küchenmeister (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) |Beschreibung EN=Every closure operator on a finite set admits a canonical minimum implication basis – the stem base or Duquenne--Guigues base – whose premises are the pseudo-closed sets. The Pseudo-Closed Family problem (PCF) asks whether a given family of sets equals the pseudo-closed sets of some closure operator. We prove…“)

5 October 2026

  • 15:1415:14, 5 October 2026 Stratified Negation in RDF Rules: A Correct Approach (hist | edit) [1,408 bytes] Nils Küchenmeister (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Stratified Negation in RDF Rules: A Correct Approach |Beschreibung EN=Combining RDF rule languages, such as N3 or SHACL Rules, with default negation is challenging. Existing methods to stratify negation often fail for RDF rules, since individual triples do not carry enough information to meaningfully restrict potential dependencies. Blank nodes in rule heads further complicate the matter, since the order of rule applications may…“)
  • 15:1215:12, 5 October 2026 Recovering Explanations from Transformed Rule-Based Ontologies (hist | edit) [1,032 bytes] Nils Küchenmeister (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Recovering Explanations from Transformed Rule-Based Ontologies |Beschreibung EN=Datalog rules are often used to define ontologies over Knowledge Graphs. Rule reasoners routinely optimise such ontologies by rewriting their rules into a form that can be evaluated more efficiently. These transformations preserve the entailed facts, but not the structure of the underlying derivations. A proof tree under the rewritten rules explains w…“)
  • 15:1015:10, 5 October 2026 Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops (hist | edit) [1,420 bytes] Nils Küchenmeister (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops |Beschreibung EN=Propositional Dynamic Logic (PDL) is a well-established modal logic of programs. Among its many extensions, the loop operator stands out for capturing the cyclic behaviour of programs: a world satisfies loop(pi) precisely when it can return to itself along a path matching the regular expression pi. While the satisfiability problem fo…“)
  • 15:0615:06, 5 October 2026 Mo' nads, mo' problems (hist | edit) [978 bytes] Nils Küchenmeister (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Mo' nads, mo' problems |Beschreibung EN=There are many important concepts in category theory that find immediate use in theoretical computer science, the most famous of which being monads. This talk will serve as a short introduction for computer scientists to the theory of monads. We will first discuss (using supporting examples from computer science) some of the foundational structures of category theory: mainly functors, natur…“)
  • 14:5414:54, 5 October 2026 Equivalence Checking Between Logic Programs with Aggregates in ASP (hist | edit) [1,514 bytes] Nils Küchenmeister (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Equivalence Checking Between Logic Programs with Aggregates in ASP |Beschreibung EN=Answer Set Programming (ASP) is a form of declarative programming. It is used in a range of practical applications in problem solving tasks, which has continued to expand in recent years. Equivalence checking is useful to determine whether modifications to a program preserve the intended meaning, or when evaluating a program’s semantic c…“)
  • 07:5507:55, 5 October 2026 Foundations of Logic Programming (WS2026) (hist | edit) [960 bytes] Hannes Straß (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Foundations of Logic Programming |Research group=Computational Logic |Lecturers=Hannes Straß |Term=WS |Year=2026 |Module=INF-Ma-25-FTK-FLP |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 syn…“)

4 October 2026

  • 13:5213:52, 4 October 2026 Foundations of Knowledge Representation (WS2026) (hist | edit) [3,819 bytes] Sebastian Rudolph (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Foundations of Knowledge Representation |Research group=Computational Logic |Lecturers=Sebastian Rudolph |Tutors=Sebastian Rudolph |Term=WS |Year=2026 |Module=INF-25-Ma-FTK-KR |SWSLecture=2 |SWSExercise=2 |SWSPractical=0 |Exam type=mündliche Prüfung |Description=== Beginning of Semester === The first lecture will take place on Monday 12 October in room APB E005 at 9:20 (DS2). === Synopsis === In this lecture, we will review the mos…“)

2 October 2026

  • 06:4706:47, 2 October 2026 Inproceedings3470 (hist | edit) [3,418 bytes] Timm Spork (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Christel |ErsterAutorNachname=Baier |FurtherAuthors=Sascha Klüppelholz; Timm Spork }} {{Inproceedings |Referiert=1 |Title=Probabilistic Model Checking via Families of Deterministic and Unambiguous Finite Automata |To appear=0 |Year=2026 |Month=August |Booktitle=37th International Conference on Concurrency Theory (CONCUR 2026) |Pages=15:1 - 15:19 |Publisher=Schloss Dagstuhl- Leibniz-Zentrum für Informatik |E…“)

1 October 2026

  • 16:0616:06, 1 October 2026 Knowledge Graphs (WS2026) (hist | edit) [7,559 bytes] Maximilian Marx (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Knowledge Graphs |Research group=Wissensbasierte Systeme |Lecturers=Markus Krötzsch |Tutors=Maximilian Marx |Term=WS |Year=2026 |Lecture series=Knowledge Graphs |SWSLecture=2 |SWSExercise=2 |SWSPractical=0 |Exam type=mündliche Prüfung |Description====News=== * the first lecture will take place on '''Tuesday, 2025-10-14, DS2 (09:20–10:50)''' in room BAR 106 <!-- * the first exercise will take place on '''Wednesday, 2025-10-22,…“)
  • 12:0912:09, 1 October 2026 Complexity Theory (WS2026) (hist | edit) [10,700 bytes] Maximilian Marx (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Complexity Theory |Research group=Wissensbasierte Systeme |Lecturers=Markus Krötzsch |Tutors=Lukas Gerlach |Term=WS |Year=2026 |Lecture series=Complexity Theory |Matrix=https://matrix.to/#/#complexity:tu-dresden.de |SWSLecture=4 |SWSExercise=2 |SWSPractical=0 |Exam type=mündliche Prüfung |Description=== Contents == This course covers both fundamental concepts and advanced topics in complexity theory. Key topics are: * '''Turing…“)

24 September 2026

  • 08:1708:17, 24 September 2026 Advanced Problem Solving and Search (WS2026) (hist | edit) [5,421 bytes] Sarah Gaggl (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Advanced Problem Solving and Search |Research group=Computational Logic; Logische Programmierung und Argumentation |Lecturers=Sarah Alice Gaggl |Tutors=Hannes Straß; Tim Lyon |Term=WS |Year=2026 |Module=CMS-CE-EL1, CMS-CE-EL2, CMS-CLS-ELG, CMS-CLS-ELV, CMS-EE-EL1, CMS-EE-EL2, CMS-VC-ELV2, INF-25-MA-FTK-APSS |SWSLecture=2 |SWSExercise=2 |SWSPractical=0 |Exam type=Klausur, nach Modulbeschreibung |Description=Problem solving and search is…“)

23 September 2026

  • 13:5513:55, 23 September 2026 Seminar Knowledge Representation (WS2026) (hist | edit) [2,038 bytes] Sebastian Rudolph (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Seminar „Knowledge Representation“ |Title_EN=Seminar “Knowledge Representation” |Research group=Computational Logic |Lecturers=Sebastian Rudolph |Language=EN |Term=WS |Year=2026 |Module=INF-25-Ma-FTK-Sem |SWSLecture=0 |SWSExercise=2 |SWSPractical=0 |Description= {{MissingTranslation|Language=de}} The topic of this seminar are === Anmeldung === Für die Teilnahme ist eine Registrierung via Opal bis zum 19. Oktober erforderlic…“)
  • 10:1010:10, 23 September 2026 News114 (hist | edit) [2,020 bytes] Tim Lyon (talk | contribs) (Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=Hannes Straß und Pascal Kettmann gewinnen den Harold Boley Distinguished Paper Award |Titel EN=Hannes Straß and Pascal Kettmann win the Harold Boley Distinguished Paper Award |Beschreibung DE=Die Computational Logic Group freut sich, bekannt zu geben, dass die Arbeit „Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory“ von Pascal Kettmann, Hannes Straß, Jesse Heyninck und J…“)
  • 08:0008:00, 23 September 2026 Proof Theory and Sequent Systems (WS2026) (hist | edit) [2,246 bytes] Tim Lyon (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Proof Theory and Sequent Systems |Research group=Computational Logic |Lecturers=Tim Lyon |Term=WS |Year=2026 |Module=INF-25-MA-FTK-ASAI, INF-BAS2, INF-VERT2 |SWSLecture=2 |SWSExercise=0 |SWSPractical=0 |Exam type=mündliche Prüfung |Description====Course Description=== Proof theory serves as one of the central pillars of mathematical logic and concerns the study and application of formal proofs. Typically, proofs are defined as synt…“)

11 September 2026

  • 12:2712:27, 11 September 2026 Techreport3063 (hist | edit) [1,878 bytes] Tim Lyon (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tim |ErsterAutorNachname=Lyon |FurtherAuthors=Lukas Zenger }} {{Techreport |Title=Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents |Year=2026 |Institution=TU Dresden |Note=Full, Appended Version }} {{Publikation Details |Abstract=We introduce the formalism of non-wellfounded and cyclic linear nested sequent calculi, developing concrete systems for linear tempor…“)

8 September 2026

  • 13:4613:46, 8 September 2026 Aktivitaet2140 (hist | edit) [333 bytes] Markus Krötzsch (talk | contribs) (Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE=Editor in Chief der Zeitschrift Transactions on Graph Data and Knowledge (TGDK) |Beschreibung EN=Editor in Chief of Transactions on Graph Data and Knowledge (TGDK) |Person=Markus Krötzsch |URL=https://drops.dagstuhl.de/entities/journal/TGDK#general |Start(Jahr)=2026 |Ende(Jahr)=2030 |Rank=★★★ }}“)

1 September 2026

  • 10:4610:46, 1 September 2026 Markus Krötzsch/Applications (hist | edit) [472 bytes] Markus Krötzsch (talk | contribs) (Die Seite wurde neu angelegt: „{{Main heading|Bewerbungen zur Promotion, als Studentische Hilfskraft oder für Praktika}} Bitte beachten Sie die entsprechenden Hinweise in englischer Sprache. Diese Informationen beziehen sich nicht auf Schülerpraktika (die wir leider nur selten anbieten können). In der Regel sollten derartige Anfragen an die Fakultät (das Dekanat) gesendet werden, sofern es nicht ein besonderes Interesse an der Arbeit meiner Pr…“)
  • 09:4509:45, 1 September 2026 Markus Krötzsch/Applications/en (hist | edit) [6,612 bytes] Markus Krötzsch (talk | contribs) (Die Seite wurde neu angelegt: „{{Main heading|How to Apply for PhD Positions, Student Assistant Jobs, and Internhips}} ''This is a personal note of Markus Krötzsch. Other professors may have other views on the matter.'' I am receiving many solicited and unsolicited emails where students around the world apply for a PhD position, student assistant job, or research internship. Most of them are unsuccessful, and many are not even answered. This page is meant to…“)

31 August 2026

  • 13:3013:30, 31 August 2026 Inproceedings3481 (hist | edit) [1,618 bytes] Alex Ivliev (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Alex |ErsterAutorNachname=Ivliev |FurtherAuthors=Markus Krötzsch; Maximilian Marx }} {{Inproceedings |Referiert=1 |Title=SPARQLing Datalog for Rule-Based Reasoning over Large Knowledge Graphs (Extended Abstract) |To appear=0 |Year=2026 |Booktitle=Proceedings of the 6th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2026) |Publisher=CEUR-WS.org |Editor=Marco Calautti…“)

25 August 2026

  • 11:5211:52, 25 August 2026 Inproceedings3480 (hist | edit) [2,016 bytes] Rajab Aghamov (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Rajab |ErsterAutorNachname=Aghamov |FurtherAuthors=Andrey Kudinov; Maik Nguyen; Jakob Piribauer }} {{Inproceedings |Referiert=1 |Title=On Modal Logics of Full Products of Neighborhood Frames |To appear=0 |Year=2026 |Booktitle=Advances in Modal Logic |Publisher=College Publications |Volume=16 |Note=To appear }} {{Publikation Details |Abstract=On the product of two neighborhood frames, three natural neighborhoo…“)
  • 11:3511:35, 25 August 2026 Article3125 (hist | edit) [1,736 bytes] Rajab Aghamov (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Rajab |ErsterAutorNachname=Aghamov |FurtherAuthors=Christel Baier; Toghrul Karimov; Joël Ouaknine; Jakob Piribauer }} {{Article |Referiert=0 |Title=Linear dynamical systems, Formal verification, Linear recurrence sequences, Markov chains |To appear=0 |Year=2026 |Journal=Nonlinear Analysis: Hybrid Systems |Volume=60 |Pages=101680 |Publisher=Elsevier }} {{Publikation Details |Bild=X1751570X.jpg |Abstract=In di…“)
  • 11:1211:12, 25 August 2026 Inproceedings3479 (hist | edit) [1,989 bytes] Rajab Aghamov (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Rajab |ErsterAutorNachname=Aghamov |FurtherAuthors=Christel Baier; Joël Ouaknine; Jakob Piribauer; Mihir Vahanwala; Isa Vialard }} {{Inproceedings |Referiert=1 |Title=Temporal Properties of Conditional Independence in Dynamic Bayesian Networks |To appear=0 |Year=2026 |Booktitle=Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26) |Pages=36601–36609 |Publisher=AAAI Press |Edit…“)
  • 07:5707:57, 25 August 2026 Inproceedings3478 (hist | edit) [2,060 bytes] Rajab Aghamov (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Rajab |ErsterAutorNachname=Aghamov |FurtherAuthors=Christel Baier; Toghrul Karimov; Rupak Majumdar; Joël Ouaknine; Jakob Piribauer; Timm Spork }} {{Inproceedings |Referiert=1 |Title=Model Checking Linear Temporal Logic with Standpoint Modalities |To appear=0 |Year=2025 |Booktitle=Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning |Pages=2--11 |Publisher=I…“)

21 August 2026

  • 08:1708:17, 21 August 2026 Inproceedings3477 (hist | edit) [1,881 bytes] Nils Küchenmeister (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Nils |ErsterAutorNachname=Küchenmeister |FurtherAuthors=Alex Ivliev; Dörthe Arndt; Markus Krötzsch }} {{Inproceedings |Referiert=1 |Title=Stratified Negation in RDF Rules: A Correct Approach |To appear=1 |Year=2026 |Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026) |Publisher=Springer |Editor=Manolis Koubarakis, Maria-Esther Vidal, Axel Polleres, Marieke van Erp, Ernesto J…“)

19 August 2026

  • 12:4612:46, 19 August 2026 Seminar Games and Graphs (WS2026) (hist | edit) [5,073 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Seminar „Selected Topics in Logic and Verification“ |Title_EN=Seminar “Selected Topics in Logic and Verification” |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Christel Baier;Jakob Piribauer |Language=EN |Term=WS |Year=2026 |Module=CMS-SEM, INF-25-Ma-FTK-Sem |SWSLecture=0 |SWSExercise=2 |SWSPractical=0 |Description=Dieses Seminar richtet sich in erster Linie an Studierende der Studiengänge Maste…“)
  • 12:3712:37, 19 August 2026 Seminar Selected Topics in Logic and Verification (WS2026) (hist | edit) [5,480 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Seminar „Selected Topics in Logic and Verification“ |Title_EN=Seminar “Selected Topics in Logic and Verification” |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Christel Baier,Jakob Piribauer |Language=EN |Term=WS |Year=2026 |Module=CMS-SEM, INF-25-Ma-FTK-Sem |SWSLecture=0 |SWSExercise=2 |SWSPractical=0 |Description=This seminar is mainly intended for students enrolled in the Master Computer Scien…“)
  • 12:2812:28, 19 August 2026 Proseminar Theoretische Informatik (WS2026) (hist | edit) [4,423 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Proseminar „Theoretische Informatik“ |Title_EN=Proseminar “Theoretische Informatik” |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Sascha Klüppelholz |Language=DE |Term=WS |Year=2026 |Module=INF-25-Ba-WIA,INF-IST-E-WIA |SWSLecture=0 |SWSExercise=2 |SWSPractical=0 |Description=Das Thema des Proseminars ist die Analyse von Algorithmen. Es werden u. a. Algorithmen aus den Büchern [https://mitpress.…“)
  • 12:2512:25, 19 August 2026 Proseminar Binäre Entscheidungsgraphen (WS2026) (hist | edit) [4,939 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Proseminar „Binäre Entscheidungsgraphen“ |Title_EN=Proseminar “Binäre Entscheidungsgraphen” |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Sascha Klüppelholz |Language=DE |Term=SS |Year=2026 |Module=INF-25-Ba-WIA,INF-IST-E-WIA |SWSLecture=0 |SWSExercise=2 |SWSPractical=0 |Description=Das Thema des Proseminars sind Binäre Entscheidungsgraphen (engl. ''binary decision diagrams'', kurz BDDs). Die…“)
  • 12:2312:23, 19 August 2026 Article3124 (hist | edit) [1,391 bytes] Jonas Karge (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Jonas |ErsterAutorNachname=Karge |FurtherAuthors=Roy Ferguson; Daniel Grimaldi; Jonas Haldimann; Ruvarashe Madzime; Thomas Meyer }} {{Article |Referiert=1 |Title=When AI Influence Helps or Hurts: Guarantees for Ranking-Based Human–AI Aggregation |To appear=1 |Year=2026 |Journal=The 17th International Conference on Scalable Uncertainty Management }} {{Publikation Details |Abstract=We present, to the best of…“)
  • 10:2710:27, 19 August 2026 CMS Research Project Model Checking (WS2026) (hist | edit) [3,115 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=CMS-Forschungsprojekt „Model Checking“ |Title_EN=CMS Research Project “Model Checking” |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Sascha Klüppelholz |Language=EN |Term=WS |Year=2026 |Module=CMS-PRO |SWSLecture=0 |SWSExercise=0 |SWSPractical=12 |Description=This course offers advanced topics in the field of verification and model checking. It is meant for students enrolled in the Master's prog…“)
  • 09:5709:57, 19 August 2026 Lecture Model Checking (WS2026) (hist | edit) [4,825 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Vorlesung „Model Checking“ |Title_EN=Lecture “Model Checking” |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Christel Baier; Sascha Klüppelholz |Language=EN |Term=WS |Year=2026 |Module=INF-25-Ma-FTK-MC |SWSLecture=4 |SWSExercise=4 |SWSPractical=0 |Description=Model Checking is a fully automatic verification method for reactive systems. This course provides an introduction to the main principles o…“)
  • 09:4409:44, 19 August 2026 Lecture Modal Logic (WS2026) (hist | edit) [5,669 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Vorlesung „Modal Logic“ |Title_EN=Lecture “Modal Logic” |Research group=Algebraische und logische Grundlagen der Informatik |Language=EN |Lecturers=Jakob Piribauer |Term=WS |Year=2026 |Module=INF-25-Ma-FTK-MoL |SWSLecture=2 |SWSExercise=2 |SWSPractical=0 |Description_EN=Modalities are expressions that quantify the truth of a statement, e.g. “possibly” and “necessarily”. Modal logics are simple, yet expressive formalisms…“)
  • 09:1509:15, 19 August 2026 Grosser Beleg Algebraische und logische Grundlagen der Informatik (WS2026) (hist | edit) [2,395 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Großer Beleg |Title_EN=Student Research Project (Großer Beleg) |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Christel Baier |Language=DE,EN |Term=WS |Year=2026 |Module=INF-25-Ma-GB |SWSLecture=0 |SWSExercise=0 |SWSPractical=100h |Description=Im Rahmen der Veranstaltung wird ein Thema mit Bezug zu den aktuellen Projekten des Lehrstuhls bearbeitet. Einen Überblick finden Sie auf der Algebraische und l…“)
  • 09:0309:03, 19 August 2026 Forschungsprojekt Algebraische und logische Grundlagen der Informatik (WS2026) (hist | edit) [2,471 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Forschungsprojekt |Title_EN=Research Project |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Christel Baier |Language=DE,EN |Term=SS |Year=2026 |Module=INF-25-Ma-FP |SWSLecture=0 |SWSExercise=0 |SWSPractical=100h |Description=Das Forschungsprojekt ist angedacht für Studierende der Studiengänge ''Master Computer Science'' und ''Diplom Information''. Teilnehmende bearbeiten ausgewählte Themen aus den Bere…“)
  • 07:1007:10, 19 August 2026 Exploration of a Research Subject: Algebraische und logische Grundlagen der Informatik (WS2026) (hist | edit) [2,322 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title_EN=Exploration of a Research Subject |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Christel Baier |Language=DE,EN |Term=WS |Year=2026 |Module=INF-25-Ma-ERS |SWSLecture=0 |SWSExercise=0 |SWSPractical=0 |UmfangAlternativ=Projekte (40 Stunden) |Description=Im Rahmen der Veranstaltung wird ein Thema mit Bezug zu den aktuellen Projekten des Lehrstuhls bearbeitet. Einen Überblick finden Sie auf der Algebrai…“) originally created as "Exploration of a Research Topic: Algebraische und logische Grundlagen der Informatik (WS2026)"
  • 06:5706:57, 19 August 2026 Belegseminar Algebraische und logische Grundlagen der Informatik (WS2026) (hist | edit) [2,365 bytes] Johannes Lehmann (talk | contribs) (Die Seite wurde neu angelegt: „{{Vorlesung |Title=Belegseminar |Title_EN=Student Project Seminar (Belegseminar) |Research group=Algebraische und logische Grundlagen der Informatik |Lecturers=Christel Baier |Language=DE,EN |Term=SS |Year=2026 |Module=INF-25-Ma-BSem |SWSLecture=0 |SWSExercise=0 |SWSPractical=0 |UmfangAlternativ=0/0/4/0 |Description=Im Rahmen des Belegseminars wird ein Thema mit Bezug zu den aktuellen Projekten des Lehrstuhls bearbeitet. Einen Überblick finden Sie auf de…“)

18 August 2026

10 August 2026

  • 06:1206:12, 10 August 2026 Inproceedings3476 (hist | edit) [1,215 bytes] Lukas Gerlach (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Julián |ErsterAutorNachname=Méndez |FurtherAuthors=Lukas Gerlach; Tobias Wieland; Alex Ivliev; Markus Krötzsch; Raimund Dachselt }} {{Inproceedings |Referiert=1 |Title=Evaluating a Visual Query Tracer and Builder for Learning Declarative Logic Programming |To appear=1 |Year=2026 |Booktitle=VIS 2026 }} {{Publikation Details |Abstract=Nemo Explain Visualizer (nev) is an interactive visual query tracer and bu…“)

5 August 2026

  • 00:0900:09, 5 August 2026 Inproceedings3475 (hist | edit) [1,312 bytes] Sebastian Rudolph (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Sebastian |ErsterAutorNachname=Rudolph }} {{Inproceedings |Referiert=1 |Title=Pseudo-Closed Family Veri�fication is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) |To appear=1 |Year=2026 |Booktitle=Conceptual Knowledge Structures |Publisher=Springer |Series=LNCS |Volume=16811 }} {{Publikation Details |Abstract=Every closure operator on a finite set admits a canonical minimum implication bas…“)

21 July 2026

  • 10:3310:33, 21 July 2026 Inproceedings3474 (hist | edit) [1,415 bytes] Alex Ivliev (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Alex |ErsterAutorNachname=Ivliev |FurtherAuthors=Markus Krötzsch; Maximilian Marx }} {{Inproceedings |Referiert=1 |Title=Recovering Explanations from Transformed Rule-Based Ontologies |To appear=1 |Year=2026 |Booktitle=Proceedings of the 25th International Semantic Web Conference (ISWC 2026) }} {{Publikation Details |Projekt=CPEC, SECAI, ScaDS.AI |Forschungsgruppe=Wissensbasierte Systeme }}“)

17 July 2026

  • 19:3019:30, 17 July 2026 Inproceedings3473 (hist | edit) [954 bytes] Hannes Straß (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Hannes |ErsterAutorNachname=Strass |FurtherAuthors=Johannes P. Wallner }} {{Inproceedings |Referiert=1 |Title=Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory |To appear=1 |Year=2026 |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA) |Publisher=IOS Press |Editor=Katie Atkinson }} {{Publikation Details |Abstract=Approximat…“)
  • 19:2819:28, 17 July 2026 Inproceedings3472 (hist | edit) [1,355 bytes] Hannes Straß (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Hannes |ErsterAutorNachname=Strass |FurtherAuthors=Johannes P. Wallner }} {{Inproceedings |Referiert=1 |Title=On the Complexity of Initial Models in Abstract Dialectical Frameworks |To appear=1 |Year=2026 |Booktitle=Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA) |Publisher=IOS Press |Editor=Katie Atkinson }} {{Publikation Details |Abstract=Abstract dialectical…“)

13 July 2026

  • 07:4107:41, 13 July 2026 TBA17 (hist | edit) [3,833 bytes] Meghna Bhadra (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=TBA |Titel EN=TBA |Beschreibung DE=TBA |Beschreibung EN=TBA |Veranstaltungsart=Vortrag |Start=2026-08-13 11:00:00 |Ende=2026-08-13 12:00:00 |Raum=APB-2026 |Vortragender=Fedor Grigoryevich Pogulskiy |Forschungsgruppe=Automatentheorie |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“)

10 July 2026

  • 09:5909:59, 10 July 2026 Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets (hist | edit) [1,963 bytes] Meghna Bhadra (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel DE=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets |Titel EN=Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets |Beschreibung DE=The talk will present a new approach for computing complete, stable, and preferred extensions of abstract argumentation frameworks. Unlike existing approaches that reduce these problems to the propositional satisfiability problem and so…“)

9 July 2026

  • 13:5913:59, 9 July 2026 News113 (hist | edit) [2,217 bytes] Tim Lyon (talk | contribs) (Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=Kurs über Standpoint Logic auf der ESSAI 2026 von Tim Lyon und Hannes Straß |Titel EN=Course on Standpoint Logic at ESSAI 2026 by Tim Lyon and Hannes Straß |Beschreibung DE=Tim Lyon und Hannes Straß hielten einen Kurs mit dem Titel „Multi-Perspective Reasoning in Knowledge Representation: An Introduction to Standpoint Logic" auf der ESSAI 2026, der European Summer School on Artificial Intelligence, in Wien. <br> Standpoint…“)
Retrieved from "https://iccl.inf.tu-dresden.de/web/Spezial:Neue_Seiten/en"