Find Academic Supervisors

• Logic Programming
• Knowledge Representation
• Artificial Intelligence
• +6 more

Bart Bogaerts is an Associate Professor in the Department of Computer Science at KU Leuven's Faculty of Engineering Science. He is affiliated with the Declarative Languages and Artificial Intelligence (DTAI) research unit and is a member of Leuven.AI - KU Leuven Institute for Artificial Intelligence. Bogaerts serves on the Council of the Faculty of Engineering Science as senior academic staff and participates in the Programme Committee for Artificial Intelligence curriculum development. His research focuses on foundational aspects of logic programming and knowledge representation, with particular expertise in approximation fixpoint theory, higher-order logic programming, and non-monotonic reasoning. Bogaerts investigates the theoretical underpinnings of stable model semantics, justification frameworks, and executable query languages. His work bridges theoretical computer science with practical applications in artificial intelligence and knowledge-based systems. Bogaerts' publication record demonstrates consistent contributions to top venues in logic programming and artificial intelligence. His recent work shows increasing focus on category-theoretic approaches to approximation theory, distributed web traversal specifications, and certified model expansion techniques. The publications reveal a strong emphasis on formal methods with applications spanning from theoretical mathematics to practical AI systems. As a promotor for multiple significant research projects, Bogaerts leads investigations into certified answer set programming (CertifASP), first-order model expansion (CertiFOX), proof generation for combinatorial optimization, distributed configuration problems, and knowledge integration paradigms. These projects, funded through 2028-2029, demonstrate his leadership in advancing the theoretical foundations of AI and logic programming. Bogaerts is actively involved in teaching courses on knowledge representation and reasoning, contributing to the development of next-generation AI researchers. His work within the DTAI research unit positions him at the forefront of declarative AI approaches in Belgium's leading research university.

Thomas EiterView profile

Professor

• Artificial Intelligence
• Knowledge Representation and Reasoning
• Computational Logic
• +7 more

Thomas Eiter is a Full Professor at the Institute of Logic and Computation, Technical University of Vienna (TU Wien), where he serves as Head of Research Unit. He is a Full Member of the Division of Mathematics and Natural Sciences since 2022 and holds leadership roles within the university. His research focuses on knowledge representation and reasoning, computational logic, algorithms and complexity in AI, declarative problem solving, nonmonotonic logic programming and databases, and reasoning about actions and change. His work bridges theoretical foundations with practical applications in artificial intelligence, particularly in logic programming and knowledge-based systems. He has made significant contributions to Answer Set Programming (ASP), developing frameworks like DLV and HEX programs that enable sophisticated reasoning capabilities. His recent publications demonstrate a strong focus on stream reasoning (LARS framework), knowledge forgetting, modular reasoning systems, and the integration of logic programming with ontologies. His research shows consistent contributions to both theoretical foundations and practical implementations of AI systems over several decades. ACM Fellow (2020) Fellow of the European Association for AI (2006) Distinguished Paper Award of the 17th International Joint Conference on Artificial Intelligence (IJCAI, 2001) Prominent Paper Award of the Artificial Intelligence Journal (2013) Test of Time Award (10 years) of the International Conference on Logic Programming (2013) Eiter has led and participated in numerous research projects, both internationally funded (such as LogiCS@TUWien, Humane AI, AI4EU) and nationally funded (including projects like BILAI, TAIGER, and several FWF-funded initiatives). His research unit has received substantial support from European Commission programs (H2020) and Austrian funding agencies (FWF, FFG, WWTF). He is actively involved in the academic community as a member of the Austrian Academy of Sciences (ÖAW), Academia Europaea, and has served on the Executive Council of AAAI. His research unit maintains strong connections with international collaborators and has developed influential systems like the DLV answer set programming system.

• Approximation Theory
• Semantics
• Constraint Satisfaction Problems
• +4 more

Bart Bogaerts is a Professor at the Vrije Universiteit Brussel , affiliated with the Federated Labs AI and Robotics and the Department of Informatics and Applied Informatics . His research centers on Approximation Theory , Logic Programming , Knowledge Representation , and Constraint Satisfaction Problems , with a focus on formalizing reasoning methods and optimizing computational systems. His recent publications emphasize certified algorithms, semantic web traversal, and formal verification, reflecting collaborations with institutions like KU Leuven and Maastricht University. Key themes include: Algorithm Certification : Integrating Coq for verified logic programming and optimization techniques. Web Technologies : Distributed subweb specifications and query processing frameworks. Nonmonotonic Reasoning : Advancing approximation fixpoint theory in knowledge representation. Scientific recognitions include the AAAI 2022 Distinguished Paper Award and the IJCAI 2021 Distinguished Paper Award . Dr. Bogaerts supervises PhD students such as Samuele Pollaci, Robbe Van Den Eede, and Dirk Vandesande in joint programs with VUB and KU Leuven.

• Logic Programming
• Fixpoint Theory
• Non-Monotonic Reasoning
• +5 more

Panos Rondogiannis is a Professor in the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens, focusing on Theoretical Informatics. His research spans logic programming semantics, fixpoint theory, and non-monotonic reasoning with contributions to higher-order constructs and formal frameworks for preference representation. His research interests include logic programming semantics, fixpoint theory, non-monotonic reasoning, and the application of higher-order constructs in programming. He explores many-valued logics for preference representation and has contributed to game-theoretic and categorical approaches in formal semantics. Rondogiannis’s recent work (2020–2024) addresses recursive functions in TensorFlow, non-monotonic fixpoint theories, and stable model semantics for higher-order logic programs. Earlier contributions (2017–2019) include advancements in approximation fixpoint theory, extensional semantics for logic programs, and the expressive power of higher-order datalog systems. No scientific awards mentioned. No advising or grant information provided in the available texts. No specific labs or collaborative teams are detailed in the provided information.

C.-H. Luke OngView profile

Professor

• Probabilistic Programming
• Programming Languages and Verification
• Semantics of Computation
• +8 more

C.-H. Luke Ong is Professor of Computer Science and Director of Graduate Studies at the Department of Computer Science, University of Oxford, and Tutorial Fellow at Merton College. He holds a BA in Mathematics (1984, Triple First) and a Postgraduate Diploma in Computer Science (1985, Distinction) from University of Cambridge, and PhD in Computer Science (1988) from Imperial College University of London. After positions at National University of Singapore (1991) and Trinity College Cambridge (1992-1993), he joined Oxford in 1994, becoming Reader in 2002 and Professor in 2004. His research spans multiple areas of theoretical computer science with recent focus on probabilistic programming, higher-order model checking, and semantics of computation. His work bridges theoretical foundations with practical applications in program verification and analysis. Ong has made significant contributions to game semantics, lambda calculus, and type theory, with recent work extending into algorithmic game theory and probabilistic computation. Ong's publication record shows a clear evolution from foundational work in semantics toward practical applications in verification and probabilistic programming. His recent articles demonstrate increasing focus on bridging theoretical computer science with practical problems in machine learning, probabilistic inference, and program analysis, particularly through higher-order model checking techniques applied to modern programming paradigms. General Chair of ACM/IEEE Symposium on Logic in Computer Science (LICS) Vice Chair of ACM Special Interest Group in Logic and Computation (SIGLOG) Member of European Association of Theoretical Computer Science (EATCS) Chairman of Singapore's Expert Panel on Mathematics and Informatics (2006-2014) Member of Singapore's Academic Research Council (since 2013) Ong has supervised 20 doctoral students to completion and currently co-supervises 9 doctoral candidates. His research has been supported by numerous grants from EPSRC and international collaborations. He has served as PC Chair for major conferences including LICS 2007, CSL 2005, FoSSaCS 2010, and TLCA 2011, demonstrating significant leadership in the theoretical computer science community. He leads research in the Centre for Metacomputation at Oxford, with active projects in higher-order model checking, algorithmic game semantics, and verification of concurrent systems. His work with the Games for Design and Verification research network has fostered international collaboration across Europe and Asia.

• Theoretical Computer Science
• Formal Methods
• Programming Languages
• +5 more

Luís Cruz-Filipe is an Associate Professor at the Department of Mathematics and Computer Science (IMADA) within the Faculty of Engineering at the University of Southern Denmark. His research spans theoretical computer science with a focus on formal methods, programming languages, and distributed systems. He maintains an active research profile with numerous publications in top venues. His research interests primarily center around choreographic programming, formal verification, sorting networks, and logic programming. Cruz-Filipe has made significant contributions to the theoretical foundations of choreographic programming, developing formal frameworks for specifying and verifying distributed communication protocols. His work on sorting networks has advanced the understanding of optimal network structures, while his research in approximation fixpoint theory has provided formal foundations for logic programming semantics. Analysis of his recent publications reveals a strong trend toward formal methods applied to distributed systems, particularly in choreographic programming where he has developed theoretical frameworks, verification techniques, and compilation approaches. His work bridges theoretical computer science with practical implementation concerns, often using proof assistants like Coq to ensure correctness. More recently, he has expanded into sustainability topics with work on green software development. As an academic, Cruz-Filipe has contributed significantly to the theoretical foundations of choreographic programming, producing a cohesive body of work that has helped establish this field. His publications demonstrate a consistent focus on formal methods to address challenges in distributed systems, with increasing attention to practical implementation and verification.

Panagiotis RondogiannisView profile

Professor

• Logic Programming
• Nonmonotonic Reasoning
• Functional Programming
• +3 more

Panagiotis Rondogiannis is a Professor in the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens. He holds degrees from the University of Patras (B.Sc., 1989) and the University of Victoria, Canada (M.Sc. 1991, Ph.D. 1994). His research focuses on Logic Programming, Nonmonotonic Reasoning, Functional/Dataflow Programming, and Semantics of Programming Languages, with a particular emphasis on higher-order extensions and fixpoint theory. His work spans foundational aspects of logic programming semantics, including stable model semantics, categorical fixpoint theory, and non-monotonic reasoning frameworks. Key contributions include advancements in higher-order Datalog, lexicographic preference modeling, and the application of game semantics to logic programs. He has published extensively in top venues like Theory and Practice of Logic Programming (TPLP), ACM Transactions on Computational Logic (TOCL), and International Conference on Logic Programming (ICLP). Rondogiannis has collaborated with leading researchers such as Angelos Charalambidis and William W. Wadge, exploring topics like bilattice-based fixpoint theory and the implementation of recursive dataflow graphs in TensorFlow. His research bridges theoretical foundations with practical applications in areas like knowledge representation and programming language design.

Barbara KönigView profile

Professor

• Automata Theory
• Formal Languages
• Software Security
• +5 more

Barbara König is a Professor at the University of Duisburg-Essen, affiliated with the Department of General Computer Science within the Faculty of Computer Science. Her research focuses on theoretical computer science, with a strong emphasis on formal methods, graph transformation systems, coalgebraic semantics, and behavioral metrics. She leads a team of researchers including postdocs and PhD students like Rebecca Bernemann and Sebastian Gurke. Her work integrates mathematical rigor with practical applications in formal verification, probabilistic systems, and automated reasoning. König has organized and contributed to numerous international conferences such as CSL, CONCUR, and ICGT, highlighting her role in advancing the field’s research agenda. Key research themes include fixpoint theory, coalgebraic modal logics, and the development of tools like CoReS for graph analysis. Her current projects explore quantitative logics, behavioral distances, and abstraction-refinement techniques for complex systems analysis. König actively contributes to academic communities through editorial roles and serves as a mentor in the university’s theoretical computer science department. Her interdisciplinary approach bridges foundational theory with applied challenges in software engineering and system modeling.

Robert BeinertView profile

Senior Lecturer

• Applied Mathematics
• Inverse Problems
• Optimal Transport
• +3 more

Robert Beinert is a Senior Lecturer (Privatdozent) in Applied Mathematics at the Technische Universität Berlin, affiliated with the Department of Applied Mathematics within the Faculty of Mathematics and Natural Sciences. He holds a Dr. rer. nat. (Ph.D.) from Georg-August-Universität Göttingen (2015) and completed his Habilitation at Technische Universität Berlin in 2025. His research focuses on inverse problems, optimal transport, phase retrieval, and mathematical imaging, with applications in signal processing and data analysis. He has held academic positions including Research Associate roles at TU Berlin (2020–2025), Karl-Franzens-Universität Graz (2016–2020), and Georg-August-Universität Göttingen (2016). His work bridges theoretical foundations and practical applications, with contributions to regularization techniques, optimal transport theory, and algorithmic development. Key research interests include phase retrieval uniqueness analysis, Gromov-Wasserstein transport, and denoising methodologies for manifold-valued data. His recent publications emphasize advancements in optimal transport frameworks, regularization strategies, and applications in image processing and machine learning.

Florian BeierView profile

Researcher

• Optimal Transport
• Multi-Marginal Optimal Transport
• Gromov-Wasserstein Distance
• +3 more

Florian Beier is a Researcher at the Institute of Mathematics, Technical University of Berlin, specializing in Applied Mathematics. Since October 2021, he has served as a research assistant pursuing his Dr. rer. nat. His academic journey includes a Master of Science (2021) and Bachelor of Science (2018), both in Mathematics from TU Berlin, with thesis topics focusing on Optimal Transport and Percolation Theory. Research interests revolve around Optimal Transport theory, particularly multi-marginal and Gromov-Wasserstein formulations, with applications to mathematical imaging and computational geometry. His work bridges theoretical advancements and practical implementations, addressing challenges in transportation barycenters, entropic regularization, and algorithmic design for complex data analysis. Notable achievements include the Best Poster Award at the 2022 International Conference on Curves and Surfaces and recognition for academic excellence at TU Berlin's Dies Mathematicus. He actively contributes to conferences and workshops, presenting groundbreaking research on transport operators and barycenter computations. Current projects involve developing fixpoint iteration methods for Gromov-Wasserstein barycenters and exploring transport kernels for unpaired data analysis. His collaborations span institutions like the University of Tübingen and KTH Royal Institute of Technology, emphasizing interdisciplinary approaches to transport problems.

• Artificial Intelligence
• Knowledge Representation
• Logic Programming
• +6 more

Marc Denecker is a Professor at the Department of Computer Science, KU Leuven, affiliated with the Faculty of Engineering Science and the Declarative Languages and Artificial Intelligence (DTAI) research group. He contributes to KU Leuven's Institute for Artificial Intelligence (Leuven.AI). Current promotor for projects like A Category-Theoretic Perspective on Approximation Fixpoint Theory (2024-2028) and Proof systems for first-order logic extended with inductive definitions (2023-2027). Co-promotor for AI in Industry: Learning and Reasoning for Automation (2021-2025) and IMPULS-AI-2021 (2021-2024). His research focuses on formal logic, knowledge representation, and artificial intelligence. Recent work includes epistemic logic for decision-making under uncertainty, approximation fixpoint theory, justification theory, and symmetry-based satisfiability optimization. Publications span venues like AAAI, SAC, and LPNMR conferences, as well as journals such as Artificial Intelligence . Key subfields include logic programming, inductive definitions, model expansion, and constructive knowledge formalization. His teaching involves courses on complex systems (G0B23A/H0N05A), knowledge representation (H02C3A), automata (G0P84A), and logic for computer science (G0T42D).

Walter GuttmannView profile

Associate Professor

• Algebra of Computing
• Software Verification
• Formal Methods
• +3 more

Walter Guttmann is an Associate Professor in the Computer Science and Software Engineering department at the University of Canterbury . He specializes in the Algebra of Computing , focusing on software correctness, formal verification, and semantic models for programming languages. Research Grants include JSPS Fellowships (2019, 2015) and DAAD Postdoc Fellowship (2010-2011) Conference Involvement spans RAMiCS (2026 co-chair), UTP (2019), and MPC (2015) His work bridges theoretical computer science with practical formal verification, particularly using Isabelle/HOL to mechanize proofs for graph algorithms like Prim's , Kruskal's , and Borůvka's . Recent publications formalize Stone relation algebras for weighted graph reasoning and develop modal algebras for concurrent dynamic logic. Scientific awards include: JSPS Invitation Fellowship (2019, 2015) DAAD Postdoc Fellowship (2010-2011) He has coordinated courses like COSC261 , COSC432 , and COSC470 , contributing to both undergraduate and postgraduate computer science education.

• Modal Logic
• Coalgebra
• Automated Reasoning
• +3 more

Prof Dirk Pattinson is a Professor in the School of Computing at Australian National University (ANU). His research focuses on modal logic, coalgebraic systems, automated reasoning, and formal methods. He holds a PhD in Computer Science and has supervised numerous research students. Research interests include coalgebraic logic, non-classical modal logics, automated theorem proving, and applications in computational social choice. His work bridges theoretical foundations with practical tools like the COOL reasoner for modal fixpoint logics. Notable contributions span over 70 peer-reviewed publications since 2008, with recent work on non-iterative modal resolution calculi (2024), Hennessy-Milner properties via topological methods (2022), and formal verification of voting systems (2021). His research often integrates algebraic, categorical, and coalgebraic perspectives.