New pages
From International Center for Computational Logic
- 14:47, 20 January 2025 News104 (hist | edit) [4,990 bytes] Alex Ivliev (talk | contribs) (Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=ICCL Forschende tragen zur Lean-Standardbibliothek bei |Titel EN=ICCL Researchers Contribute to Lean Standard Library |Beschreibung DE=<p>Johannes Tantow (ehemaliger Student der Gruppe Wissensbasierte Systeme; jetzt wissenschaftlicher Mitarbeiter an der TU Chemnitz) und Lukas Gerlach (Wissenschaftlicher Mitarbeiter der Gruppe Wissensbasierte Systeme) haben kürzlich eine große Anzahl von Resultaten rund um Hash-Maps zur Standard…“)
- 14:47, 20 January 2025 News104/en (hist | edit) [16 bytes] Alex Ivliev (talk | contribs) (Page created automatically by parser function on page News104)
- 16:41, 9 January 2025 Meghna Bhadra/Abschlussarbeiten/en (hist | edit) [77 bytes] Sebastian Rudolph (talk | contribs) (Page created automatically by parser function on page Meghna Bhadra)
- 16:41, 9 January 2025 Meghna Bhadra/Abschlussarbeiten (hist | edit) [59 bytes] Sebastian Rudolph (talk | contribs) (Page created automatically by parser function on page Meghna Bhadra)
- 16:41, 9 January 2025 Meghna Bhadra (hist | edit) [360 bytes] Sebastian Rudolph (talk | contribs) (Die Seite wurde neu angelegt: „{{Mitarbeiter |Vorname=Meghna |Nachname=Bhadra |Akademischer Titel=MSc |Forschungsgruppe=Computational Logic |Stellung=Wissenschaftlicher Mitarbeiter |Ehemaliger=0 |Telefon=+49 351 463 38426 |Email=meghna.bhadra@tu-dresden.de |Raum=APB 2020 |Publikationen anzeigen=1 |Abschlussarbeiten anzeigen=1 }}“)
- 16:41, 9 January 2025 Meghna Bhadra/Publikationen/en (hist | edit) [88 bytes] Sebastian Rudolph (talk | contribs) (Page created automatically by parser function on page Meghna Bhadra)
- 16:41, 9 January 2025 Meghna Bhadra/Publikationen (hist | edit) [70 bytes] Sebastian Rudolph (talk | contribs) (Page created automatically by parser function on page Meghna Bhadra)
- 16:41, 9 January 2025 Meghna Bhadra/en (hist | edit) [18 bytes] Sebastian Rudolph (talk | contribs) (Page created automatically by parser function on page Meghna Bhadra)
- 16:27, 9 January 2025 Katrin Heber (hist | edit) [310 bytes] Sebastian Rudolph (talk | contribs) (Die Seite wurde neu angelegt: „{{Mitarbeiter |Vorname=Katrin |Nachname=Heber |Forschungsgruppe=Computational Logic; Logische Programmierung und Argumentation |Stellung=Sekretärin |Ehemaliger=0 |Telefon=+49 351 463 38516 |Fax=+49 351 463 32827 |Email=cl@tu-dresden.de |Raum=APB 2034 |Publikationen anzeigen=0 |Abschlussarbeiten anzeigen=0 }}“)
- 16:27, 9 January 2025 Katrin Heber/en (hist | edit) [18 bytes] Sebastian Rudolph (talk | contribs) (Page created automatically by parser function on page Katrin Heber)
- 12:37, 5 January 2025 Veröffentlichungen/2025/en (hist | edit) [99 bytes] Maximilian Marx (talk | contribs) (Die Seite wurde neu angelegt: „{{Wiki Seite Veröffentlichungen nach Jahr|langsuffix=/en|year={{#titleparts:{{PAGENAME}}|-1|-2}}}}“)
- 12:36, 5 January 2025 Veröffentlichungen/2025 (hist | edit) [82 bytes] Maximilian Marx (talk | contribs) (Die Seite wurde neu angelegt: „{{Wiki Seite Veröffentlichungen nach Jahr|year={{#titleparts:{{PAGENAME}}||-1}}}}“)
- 14:58, 19 December 2024 Techreport3052 (hist | edit) [1,536 bytes] Sarah Gaggl (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Elisa |ErsterAutorNachname=Böhl |FurtherAuthors=Stefan Ellmauthaler; Sarah Alice Gaggl }} {{Techreport |Title=Winning Snake: Design Choices in Multi-Shot ASP |Year=2024 |Month=August |Institution=arXiv.org |Type=to appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2024 |Archivierungsnummer=arXiv:2408.08150 }} {{Publikation Details |Abstract=Answer set programming is a well-unders…“)
- 07:52, 17 December 2024 GPTKB: Comprehensively Materializing Factual LLM Knowledge (hist | edit) [1,593 bytes] Lukas Gerlach (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=GPTKB: Comprehensively Materializing Factual LLM Knowledge |Beschreibung EN=LLMs have majorly advanced NLP and AI, and next to their ability to perform a wide range of procedural tasks, a major success factor is their internalized factual knowledge. Since (Petroni et al., 2019), analyzing this knowledge has gained attention. However, most approaches investigate one question at a time via modest-sized pre-defined samples, introduc…“)
- 07:52, 17 December 2024 GPTKB: Comprehensively Materializing Factual LLM Knowledge/en (hist | edit) [20 bytes] Lukas Gerlach (talk | contribs) (Page created automatically by parser function on page GPTKB: Comprehensively Materializing Factual LLM Knowledge)
- 13:23, 13 December 2024 News103 (hist | edit) [3,821 bytes] Alex Ivliev (talk | contribs) (Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=Jonas Karge gewinnt Student Best Paper Award auf der PRIMA24 |Titel EN=Jonas Karge Wins Student Best Paper Award at PRIMA24 |Beschreibung DE=<p>Jonas Karge, Doktorand am Lehrstuhl für Computational Logic am Institut für Theoretische Informatik der TU Dresden, wurde auf der diesjährigen [https://sites.google.com/view/prima-2024/ International Conference on Principles and Practice of Multi-Agent Systems (PRIMA24)] in Kyoto,…“)
- 13:23, 13 December 2024 News103/en (hist | edit) [16 bytes] Alex Ivliev (talk | contribs) (Page created automatically by parser function on page News103)
- 16:11, 9 December 2024 Tree Automata with Global and Non-Global Counting (hist | edit) [2,400 bytes] Lukas Gerlach (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Tree Automata with Global and Non-Global Counting |Beschreibung EN=Similar to the case of finite string automata, there is a long tradition of adding counting mechanisms to finite tree automata in order to increase their expressiveness, resulting in two interesting models (among others): Parikh tree automata (PTA) increment a number of counters when computing a tree and eventually test their membership in a semilinear set. On the…“)
- 16:11, 9 December 2024 Tree Automata with Global and Non-Global Counting/en (hist | edit) [20 bytes] Lukas Gerlach (talk | contribs) (Page created automatically by parser function on page Tree Automata with Global and Non-Global Counting)
- 14:27, 4 December 2024 Inproceedings3404 (hist | edit) [1,355 bytes] Tim Lyon (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tim |ErsterAutorNachname=Lyon }} {{Inproceedings |Referiert=1 |Title=On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic |To appear=1 |Year=2025 |Booktitle=Proceedings of the Eleventh International Conference on Fundamentals of Software Engineering (FSEN) |Publisher=Springer |Series=LNCS }} {{Publikation Details |Abstract=Propositional dynamic logic (PDL) is an important modal logic…“)
- 11:07, 3 December 2024 News102/en (hist | edit) [16 bytes] Alex Ivliev (talk | contribs) (Page created automatically by parser function on page News102)
- 11:07, 3 December 2024 News102 (hist | edit) [4,034 bytes] Alex Ivliev (talk | contribs) (Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=Best Paper Award für Nemo |Titel EN=Best Paper Award for Nemo |Beschreibung DE=<p>Forschende der Professur Wissensbasierte Systeme am Institut für Theoretische Informatik der TU Dresden wurden auf der renommierten [https://kr.org/KR2024/ KR-Konferenz 2024] in Hanoi, Vietnam mit dem Best-Paper-Award im Track "KR in the Wild" geehrt. Die Autoren Alex Ivliev, Lukas Gerlach, Simon Meusel, Jakob Steinberg und Marku…“)
- 13:28, 25 November 2024 The RustBelt and its Separation Logic (hist | edit) [869 bytes] Lukas Gerlach (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=The RustBelt and its Separation Logic |Beschreibung EN=Rust is a systems-programming language whose expressive type system centers around the concept of ownership enabling both stronger, statically verified safety guarantees as well as lower level control compared to more mainstream "safe" languages. The RustBelt project provided some formal verification for those claims using a seperation logic for modelling rusts typing rules.…“)
- 13:28, 25 November 2024 The RustBelt and its Separation Logic/en (hist | edit) [20 bytes] Lukas Gerlach (talk | contribs) (Page created automatically by parser function on page The RustBelt and its Separation Logic)
- 08:49, 21 November 2024 Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic (hist | edit) [2,041 bytes] Lukas Gerlach (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic |Beschreibung EN=This is a talk about a paper with the following abstract: Although simple individually, artificial neurons provide state-of-the-art performance when interconnected in deep networks. Arguably, the Tsetlin Automaton is an even simpler and more versatile learning mechanism, capable of solving the mult…“)
- 08:49, 21 November 2024 Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic/en (hist | edit) [20 bytes] Lukas Gerlach (talk | contribs) (Page created automatically by parser function on page Tsetlin Machine, A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic)
- 15:51, 13 November 2024 Inproceedings3403 (hist | edit) [2,411 bytes] Tim Lyon (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tim |ErsterAutorNachname=Lyon }} {{Inproceedings |Referiert=1 |Title=Unifying Sequent Systems for G{\"o}del-L{\"o}b Provability Logic via Syntactic Transformations |To appear=1 |Year=2025 |Booktitle=Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic 2025 |Publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik |Editor=Jörg Endrullis, Sylvain Schmitz |Series=LIPIcs |Volume=326 }} {…“)
- 15:47, 13 November 2024 Inproceedings3402 (hist | edit) [2,254 bytes] Tim Lyon (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tim |ErsterAutorNachname=Lyon |FurtherAuthors=Ian Shillito; Alwen Tiu }} {{Inproceedings |Referiert=1 |Title=Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents |To appear=1 |Year=2025 |Booktitle=Proceedings of the 33rd EACSL Annual Conference on Computer Science Logic 2025 |Publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik |Editor=Jörg Endrullis, Sylv…“)
- 10:43, 13 November 2024 Techreport3053 (hist | edit) [333 bytes] Dörthe Arndt (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Dörthe |ErsterAutorNachname=Arndt |FurtherAuthors=Stephan Mennike }} {{Techreport |Title=Existential Notation3 Logic |Year=2024 |Month=April |Institution=TPLP |Type=Submission }} {{Publikation Details |Bild=ExistentialN3.pdf |Forschungsgruppe=Computational Logic }}“)
- 07:39, 11 November 2024 Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium/en (hist | edit) [20 bytes] Lukas Gerlach (talk | contribs) (Page created automatically by parser function on page Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium)
- 07:39, 11 November 2024 Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium (hist | edit) [2,202 bytes] Lukas Gerlach (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Towards Understanding Brain Function by Uncovering the Conceptual Structure of C.elegans Sensorium |Beschreibung EN=The framework of Embodied and Embedded cognition suggests that animals engage in a contin- uous sensory-motor feedback loop with their environment, mediated by their nervous systems. A significant challenge in the study of nervous systems lies in the lack of a comprehensive model for the sensorium—the mechanism…“)
- 07:37, 11 November 2024 Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting (hist | edit) [2,017 bytes] Lukas Gerlach (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting |Beschreibung EN=Answer Set Programming (ASP) is a key paradigm for problems in artificial intelligence and industrial contexts. In ASP, problems are modeled via a set of rules. Over the time this paradigm grew into a rich language, enabling complex rule types like aggregate expressions. Most practical ASP systems follow a ground-and-solve pattern, where ru…“)
- 07:37, 11 November 2024 Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting/en (hist | edit) [20 bytes] Lukas Gerlach (talk | contribs) (Page created automatically by parser function on page Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting)
- 04:13, 10 November 2024 Aktivitaet2134 (hist | edit) [346 bytes] Sarah Gaggl (talk | contribs) (Die Seite wurde neu angelegt: „{{Aktivität |Beschreibung DE=Senior Area Chair der 34. International Joint Conference on Artificial Intelligence (IJCAI 2025) |Beschreibung EN=Senior Area Chair of the 34th International Joint Conference on Artificial Intelligence (IJCAI 2025) |Person=Sarah Gaggl |URL=https://2025.ijcai.org |Start(Jahr)=2024 |Ende(Jahr)=2025 |Rank=★★★ }}“)
- 03:53, 10 November 2024 Misc3083 (hist | edit) [1,901 bytes] Sarah Gaggl (talk | contribs) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Sarah Alice |ErsterAutorNachname=Gaggl }} {{Misc |Title=Navigating ASP Solution Spaces |Year=2024 |Month=November |Howpublished=Invited Talk }} {{Publikation Details |Abstract=A wide range of combinatorial search problems can be modelled and solved with Answer Set Programming (ASP). While modern ASP solvers allow to quickly enumerate solutions, the user faces the problem of dealing with a possibly exponential…“)
- 09:16, 22 October 2024 Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT (hist | edit) [813 bytes] Simon Razniewski (talk | contribs) (Die Seite wurde neu angelegt: „{{Veranstaltung |Titel EN=Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT |Beschreibung EN=In the first part of this talk, I will provide an overview of the field of knowledge-aware artificial intelligence, with a focus on two pillars of AI knowledge, knowledge graphs (KGs) and large language models (LLMs). The second part will highlight key areas of my research, including knowledge estimation, knowledge extraction,…“)
- 09:16, 22 October 2024 Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT/en (hist | edit) [20 bytes] Simon Razniewski (talk | contribs) (Page created automatically by parser function on page Knowledge-aware Artificial Intelligence or How to Rock Your CS@TUD Studies with chatGPT)
- 15:59, 21 October 2024 Tom Friese (hist | edit) [193 bytes] Maximilian Marx (talk | contribs) (Die Seite wurde neu angelegt: „{{Mitarbeiter |Vorname=Tom |Nachname=Friese |Forschungsgruppe=Wissensbasierte Systeme |Stellung=Doktorand |Ehemaliger=0 |Publikationen anzeigen=0 |Abschlussarbeiten anzeigen=0 }}“)
- 15:59, 21 October 2024 Tom Friese/en (hist | edit) [18 bytes] Maximilian Marx (talk | contribs) (Page created automatically by parser function on page Tom Friese)
- 18:35, 20 October 2024 Cyclic Proof Theory (hist | edit) [1,033 bytes] Stephan Mennicke (talk | contribs) (Tim's invited speaker/talk)
- 18:35, 20 October 2024 Cyclic Proof Theory/en (hist | edit) [20 bytes] Stephan Mennicke (talk | contribs) (Page created automatically by parser function on page Cyclic Proof Theory)
