Propositional Model Counting Professors and Supervisors in Austria

Stefan Woltranمشاهده پروفایل

استاد

Vienna University of TechnologyAustria

Stefan Woltran is a Full Professor in the Databases and Artificial Intelligence department at TU Wien. He serves as Vice Dean of Academic Affairs for the Informatics Master program and leads the Research Unit for Databases and Artificial Intelligence. His research focuses on logic-based AI, including Propositional Logic, Nonmonotonic Reasoning, Argumentation frameworks, Knowledge Representation, and Logic Programming. He coordinates the Double-Degree Program Logic and Computation. His research projects include analyzing formal properties of logic-based AI approaches, complexity analysis, and developing algorithms via logic and dynamic programming. Notable projects include the HYPAR and REVEAL-AI initiatives exploring abstract argumentation and AI problem-solving. He has contributed to over 150 publications since 2001, focusing on argumentation frameworks, computational complexity, and formal methods. Woltran teaches courses such as Abstract Argumentation, Formal Methods in Computer Science, and Theoretical Computer Science. His work integrates theoretical advancements with practical solver development, such as the ASPARTIX system for argumentation tasks. He actively participates in international conferences and competitions in computational argumentation, emphasizing the application of formal methods to real-world problems.

پروفایل رسمی دانشگاه

Martina Seidlمشاهده پروفایل

استاد

Johannes Kepler University LinzAustria

Martina Seidl is a Professor at the Johannes Kepler University Linz , serving as Head of the Institute for Symbolic Artificial Intelligence . She leads research initiatives in formal verification, quantified Boolean formulas, and symbolic AI. Key Projects : Industrial problem solving using symbolic AI (2025–2026), Cluster of Excellence "Bilateral AI" (2024–2029), LOGTECHEDU (2018–2020) Leadership Roles : PhD Committee member at TU Wien, Associate Editor for the Artificial Intelligence Journal Her research focuses on automated reasoning , QBF solving , and formal methods in computer science. She has developed tools like PyQBF and Booleguru for propositional logic and constraint solving. Recent publications analyze semantic feature model differences, solution counting for QBF families, and tree-based model counters. She contributes to educational programs through lectures on formal models, SAT solving, and neurosymbolic AI. Scientific activities include organizing workshops like "Alles Logisch?" and participating in program committees. Current funded projects emphasize interdisciplinary AI applications and logic-based educational technologies.

پروفایل رسمی دانشگاه

Leroy Chewمشاهده پروفایل

پژوهشگر ارشد

Vienna University of TechnologyAustria

Dr. Leroy Chew is a Research Fellow at the Institute of Logic and Computation at Technische Universität Wien. He specializes in theoretical computer science with focus areas in proof complexity, quantified Boolean formulas (QBF), and SAT solving. His educational background includes a PhD from the University of Leeds and postdoctoral research at Carnegie Mellon University. Dr. Chew's research explores the boundaries of computational complexity and formal verification systems. His current projects include developing novel proof systems for quantified formulas and expansion-based approaches for constraint satisfaction problems. He leads research funded by the ESPRIT Grant on QBF Proofs and Certificates. His publication record demonstrates consistent contributions to formal verification and computational logic, with recent advances in strategy extraction techniques and dual proof systems. He maintains academic collaborations across Europe and the United States, and has served on program committees for major conferences including SAT and QBF Workshops. Dr. Chew has received the EPSRC Postdoctoral Prize Research Fellowship and continues to develop computational tools for the research community, including proof generators and strategy extraction software.

پروفایل رسمی دانشگاه

Leroy Nicholas Chewمشاهده پروفایل

پژوهشگر

Vienna University of TechnologyAustria

Leroy Nicholas Chew is a PostDoc Researcher and FWF Projektassistent at the Vienna University of Technology (TU Wien). He is affiliated with the Department of Algorithms and Complexity within the Faculty of Informatics. His roles include contributing to research projects such as QBFPC (2022–2025), Overcoming Intractability in the Knowledge Compilation Map, and REVEAL-AI (2020–2024). These projects reflect his focus on advancing theoretical computer science and automated reasoning methodologies. While specific educational details are not explicitly provided in the text, Leroy Nicholas Chew holds a PhD, as indicated by his role listing. His current position suggests a strong background in computer science and theoretical foundations, consistent with his research activities. His research interests span several key areas in theoretical computer science, including proof complexity, quantified Boolean formulas (QBF), automated reasoning, and knowledge compilation. He explores the hardness of computational problems in logical frameworks, such as analyzing resolution and CDCL proof systems, developing optimal dual proof systems for answer set programming (ASP), and investigating model counting techniques. His work often bridges foundational theory with practical applications in formal verification and algorithm design. Recent publications (2024) highlight advancements in circuits and proofs, model counting, and ASP-QRAT proof systems. Earlier work (2016–2022) addressed QBF resolution calculi, dependency schemes, and certification challenges. These trends underscore his specialization in formal methods and computational logic. No scientific awards are explicitly mentioned in the provided text. In addition to his research, Chew is involved in multiple funded projects. These include the FWF-supported QBFPC (2022–2025), which examines QBF proofs and certificates, and the REVEAL-AI project (2020–2024), focusing on overcoming intractability in knowledge compilation. While specific grant details beyond project funding are not mentioned, his participation underscores his role in collaborative, grant-funded research initiatives. No formal advisees are listed. Chew is part of the Algorithms and Complexity department at TU Wien, collaborating on projects that emphasize proof systems, formal verification, and algorithmic foundations. His work integrates theoretical insights with practical computational methods.

پروفایل رسمی دانشگاه

Friedrich Slivovskyمشاهده پروفایل

پژوهشگر

Vienna University of TechnologyAustria

Friedrich Slivovsky is a researcher at the Institute of Logic and Computation within the Faculty of Informatics at Technische Universität Wien (Vienna University of Technology). His work focuses on theoretical and practical aspects of computational logic, with particular expertise in Quantified Boolean Formulas (QBFs), Propositional Model Counting (#SAT), and Knowledge Compilation. His research interests span the theoretical foundations and practical applications of computational logic. Slivovsky investigates the complexity of logical reasoning problems, develops efficient algorithms for solving them, and creates practical tools that implement these theoretical advances. His work bridges the gap between theoretical computer science and practical applications in areas like hardware verification, artificial intelligence, and electronic design automation. Analysis of his publication trends reveals a consistent focus on QBF solving techniques, with increasing emphasis on circuit minimization, proof complexity, and practical solver engineering. His recent work (2023-2024) shows a strong focus on circuit minimization techniques, combining QBF and SAT approaches to solve complex optimization problems in hardware design. Earlier work (2019-2021) emphasized dependency schemes, certification methods, and theoretical foundations of QBF solving. Slivovsky leads several significant software projects that have become important tools in the computational logic community: Qute : A dependency learning QBF solver with GitHub repository showing active development (latest commit December 2024) Unique : A preprocessor for (D)QBF that computes unique Skolem and Herbrand functions Pedant : A certifying DQBF solver These projects demonstrate his commitment to translating theoretical advances into practical tools that benefit the broader research community.

پروفایل رسمی دانشگاه

Thomas Eiterمشاهده پروفایل

استاد

Vienna University of TechnologyAustria

Thomas Eiter is a Professor at TU Wien's Institute of Logic and Computation. His research focuses on declarative programming paradigms, knowledge representation, and artificial intelligence. He leads projects in neurosymbolic systems, answer set programming (ASP), and stream reasoning, with applications in visual question answering, scheduling optimization, and semantic scene generation. Eiter has contributed to foundational work in ASP semantics, computational complexity, and hybrid reasoning frameworks. His work bridges logical formalisms with practical AI challenges, emphasizing explainability and scalability. Projects like ALASPO and neurosymbolic integration showcase his focus on advancing both theoretical and applied aspects of AI. Projects: HumanE AI Network, WASP, REWERSE Research Themes: Neurosymbolic AI, Answer Set Programming, Stream Reasoning Notable achievements include pioneering work on semiring-based reasoning frameworks and developing efficient ASP solvers like Alpha. His contributions span over 471 publications, emphasizing interdisciplinary applications in computer vision, robotics, and automated planning.

پروفایل رسمی دانشگاه