جست‌وجوی استاد و پژوهشگر

Martin Dillerمشاهده پروفایل

پژوهشگر

• Formal Argumentation
• AI Systems
• Probabilistic Argumentation
• +۳ مورد دیگر

Martin Diller is a Researcher at the International Center for Computational Logic (ICCL) at TU Dresden, where he has been since May 2019. He is part of the 'Logic Programming and Argumentation' group led by Sarah Gaggl. His current research focuses on formal models of argumentation and their application in AI systems, particularly within the SEMECO interdisciplinary cluster on AI-assisted regulatory workflows for medical systems and cybersecurity. Education: Holds a joint MSc in Computational Logic from TU Wien, TU Dresden, and University of Bolzano (via the EMCL program with an Erasmus Mundus scholarship). Previously completed a MA in Philosophy (Logic & Epistemology) and BSc in Computer Science at Universidad Nacional de Córdoba, Argentina, with postgraduate funding from CONICET. Also conducted research internships at University of Aberdeen, UCL, NICTA (Canberra), and others. Key Projects: Active in the Transregional Collaborative Research Center ‘Foundations of Perspicuous Software Systems’ (2019–2022), and the Center for Scalable Data Analytics and Artificial Intelligence (2023). Currently leads research in probabilistic argumentation and flexible dispute derivations for assumption-based arguments. Key Contributions: Developed the 'flexABle' system for argumentation framework analysis, contributed to admissibility criteria in probabilistic argumentation, and advanced methods for integrating natural language processing with formal argumentation systems. Grants & Funding: Involved in EU-funded interdisciplinary projects and German collaborative research initiatives. Labs/Teams: Core member of the Logic Programming and Argumentation group at ICCL, collaborating with institutions worldwide.

Leander Tentrupمشاهده پروفایل

پژوهشگر

• Formal Verification
• Reactive Synthesis
• Quantified Boolean Formulas (QBF)
• +۳ مورد دیگر

Leander Tentrup is a researcher in the Reactive Systems Group at Saarland University's Computer Science Department. He earned his Ph.D. in 2019 with a thesis titled Symbolic Reactive Synthesis , focusing on automated system design and verification. His work emphasizes formal methods for reactive systems, quantified Boolean formulas (QBF), and hyperproperty monitoring in cyber-physical systems. Education : Ph.D. in Computer Science (Saarland University, 2019). Research Interests : Formal verification, reactive synthesis, QBF solving, distributed systems, runtime monitoring, and security-critical systems. Notable contributions include award-winning solvers like CAQE and tools like RVHyper for hyperproperty monitoring. Scientific Achievements : Won the Reactive Synthesis Competition and Competitive Evaluation of QBF Solvers. His research bridges theoretical advances in formal methods with practical tool implementations. Teaching & Mentoring : Advised and tutored students in courses on formal verification, embedded systems, and security protocols. Active in mentoring seminar projects on hyperproperties and infinite games. Labs & Teams : Core member of the Reactive Systems Group, contributing to the development of tools like StreamLAB, BoSy, and QuAbS for automated system design and analysis.