Recent changes
From International Center for Computational Logic
Track the most recent changes to the wiki on this page.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
8 October 2026
|
|
N 11:52 | Inproceedings3484 2 changes history +1,253 [Pascal Kettmann (2×)] | |||
|
|
11:52 (cur | prev) +798 Pascal Kettmann talk contribs | ||||
| N |
|
11:44 (cur | prev) +455 Pascal Kettmann talk contribs (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Pascal |ErsterAutorNachname=Kettmann |FurtherAuthors=Hannes Straß; Jesse Heyninck; Jeroen Spaans }} {{Inproceedings |Referiert=1 |Title=Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory |To appear=1 |Year=2026 |Booktitle=The 10th International Joint Conference on Rules and Reasoning }} {{Publikation Details |Projekt=SECAI |Forschungsgruppe=Computational Logic }}“) | |||
| 11:37 | Upload log Pascal Kettmann talk contribs uploaded Datei:Eflp-aft-ruleml26.pdf | ||||
| 10:58 | Deletion log Francesco Kriegel talk contribs deleted page Datei:Foto francesco.jpg (Inhalt war: „“. Einziger Bearbeiter: Francesco Kriegel (Diskussion)) | ||||
| N 10:29 | Reinforcement Learning for BDD Variable Ordering diffhist +339 Nils Küchenmeister talk contribs (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Reinforcement Learning for BDD Variable Ordering |Veranstaltungsart=Vortrag |Start=2026-11-05 11:00:00 |Ende=2026-11-05 12:00:00 |Raum=APB 3027 |Vortragender=Luke Slater |Eingeladen durch=Markus Krötzsch |Forschungsgruppe=Wissensbasierte Systeme |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“) | ||||
| N 10:25 | Survey of Syntax Splitting diffhist +319 Nils Küchenmeister talk contribs (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Survey of Syntax Splitting |Veranstaltungsart=Vortrag |Start=2026-11-12 11:00:00 |Ende=2026-11-12 12:00:00 |Raum=APB 3027 |Vortragender=Ameerah Allie |Eingeladen durch=Markus Krötzsch |Forschungsgruppe=Wissensbasierte Systeme |Event series=Research Seminar Logic and AI |In News anzeigen=1 }}“) | ||||
| 08:29 | Advanced Problem Solving and Search (WS2026) diffhist 0 Sarah Gaggl talk contribs | ||||
7 October 2026
| 09:11 | Inproceedings3473 diffhist +17 Hannes Straß talk contribs | ||||
| 09:10 | Inproceedings3472 diffhist +17 Hannes Straß talk contribs | ||||
| 08:12 | Research Seminar Logic and AI diffhist +6 Nils Küchenmeister talk contribs | ||||
| N 07:35 | Inproceedings3483 diffhist +2,157 Tim Lyon talk contribs (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tim |ErsterAutorNachname=Lyon |FurtherAuthors=Omar Taher }} {{Inproceedings |Referiert=1 |Title=Optimizing Proof-Search via Linearization for Gödel-Löb Logic with Tree-Hypersequents |To appear=0 |Year=2026 |Booktitle=Proceedings Seventeenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2026) |Pages=148-164 |Publisher=Electronic Proceedings in Theoretical Computer Scien…“) | ||||
| N 07:33 | Inproceedings3482 diffhist +1,974 Tim Lyon talk contribs (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tim |ErsterAutorNachname=Lyon |FurtherAuthors=Lukas Zenger }} {{Inproceedings |Referiert=1 |Title=Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents |To appear=0 |Year=2026 |Booktitle=Proceedings Seventeenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2026) |Pages=165-182 |Publisher=Electronic Proceedings in Theoretical Co…“) | ||||
6 October 2026
|
|
20:26 | Foundations of Knowledge Representation (WS2026) 3 changes history +131 [Sebastian Rudolph (3×)] | |||
|
|
20:26 (cur | prev) +43 Sebastian Rudolph talk contribs | ||||
|
|
15:12 (cur | prev) +42 Sebastian Rudolph talk contribs | ||||
|
|
11:50 (cur | prev) +46 Sebastian Rudolph talk contribs | ||||
|
|
20:26 | (Upload log) [Maximilian Marx; Sebastian Rudolph (3×)] | |||
|
|
20:26 Sebastian Rudolph talk contribs uploaded Datei:FKR-2026-exercise-1-Logic4KR.pdf | ||||
|
|
17:27 Maximilian Marx talk contribs uploaded Datei:Kg2026-exercise-00.pdf | ||||
|
|
15:12 Sebastian Rudolph talk contribs uploaded Datei:FKR-2026-lecture-2-Logic4KR.pdf | ||||
|
|
11:50 Sebastian Rudolph talk contribs uploaded Datei:FKR-2026-lecture-1-Introduction.pdf | ||||
|
|
17:28 | Knowledge Graphs (WS2026) 3 changes history −272 [Maximilian Marx; Stephan Mennicke (2×)] | |||
|
|
17:28 (cur | prev) +33 Maximilian Marx talk contribs | ||||
|
|
08:42 (cur | prev) −16 Stephan Mennicke talk contribs (further room changes, also in dates & materials) | ||||
|
|
08:41 (cur | prev) −289 Stephan Mennicke talk contribs (room change after lecture schedule publication) | ||||
| N 08:49 | HSZ 204 diffhist +325 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. }}“) | ||||
| N 08:48 | HSZ 304 diffhist +326 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. }}“) | ||||
|
|
08:37 | Advanced Problem Solving and Search (WS2026) 4 changes history 0 [Sarah Gaggl (4×)] | |||
|
|
08:37 (cur | prev) 0 Sarah Gaggl talk contribs | ||||
|
|
08:37 (cur | prev) 0 Sarah Gaggl talk contribs | ||||
|
|
08:36 (cur | prev) 0 Sarah Gaggl talk contribs | ||||
|
|
06:28 (cur | prev) 0 Sarah Gaggl talk contribs | ||||
|
|
07:22 | Research Seminar Logic and AI 4 changes history +77 [Nils Küchenmeister (4×)] | |||
|
|
07:22 (cur | prev) +20 Nils Küchenmeister talk contribs | ||||
|
|
06:33 (cur | prev) +15 Nils Küchenmeister talk contribs | ||||
|
|
06:32 (cur | prev) −3 Nils Küchenmeister talk contribs | ||||
|
|
06:31 (cur | prev) +45 Nils Küchenmeister talk contribs | ||||
| N 06:26 | Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem) diffhist +1,030 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
|
|
16:02 | Complexity Theory (WS2026) 3 changes history +5,668 [Maximilian Marx (3×)] | |||
|
|
16:02 (cur | prev) −441 Maximilian Marx talk contribs | ||||
|
|
16:01 (cur | prev) +6,084 Maximilian Marx talk contribs | ||||
|
|
14:29 (cur | prev) +25 Maximilian Marx talk contribs | ||||
|
|
15:27 | Knowledge Graphs (WS2026) 6 changes history +3,930 [Maximilian Marx (6×)] | |||
|
|
15:27 (cur | prev) −195 Maximilian Marx talk contribs | ||||
|
|
15:26 (cur | prev) +4,065 Maximilian Marx talk contribs | ||||
|
|
14:34 (cur | prev) 0 Maximilian Marx talk contribs | ||||
|
|
14:33 (cur | prev) 0 Maximilian Marx talk contribs | ||||
|
|
14:32 (cur | prev) +26 Maximilian Marx talk contribs | ||||
|
|
14:30 (cur | prev) +34 Maximilian Marx talk contribs | ||||
| N 15:14 | Stratified Negation in RDF Rules: A Correct Approach diffhist +1,408 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…“) | ||||
| N 15:12 | Recovering Explanations from Transformed Rule-Based Ontologies diffhist +1,032 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…“) | ||||
|
|
N 15:10 | Towards Finite Satisfiability Problem for Propositional Dynamic Logic with Loops 2 changes history +1,420 [Nils Küchenmeister (2×)] | |||
|
|
15:10 (cur | prev) +1 Nils Küchenmeister talk contribs | ||||
| N |
|
15:10 (cur | prev) +1,419 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…“) | |||
| N 15:06 | Mo' nads, mo' problems diffhist +978 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…“) | ||||
|
|
N 14:57 | Equivalence Checking Between Logic Programs with Aggregates in ASP 2 changes history +1,514 [Nils Küchenmeister (2×)] | |||
|
|
14:57 (cur | prev) −14 Nils Küchenmeister talk contribs | ||||
| N |
|
14:54 (cur | prev) +1,528 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…“) | |||
| 12:53 | Techreport3063 diffhist +115 Tim Lyon talk contribs | ||||
