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

Jelle Hellingsمشاهده پروفایل

استادیار

• Resilient Systems
• High-Performance Data Management
• Database Theory
• +۱۰ مورد دیگر

Jelle Hellings is an Assistant Professor in the Department of Computing and Software at McMaster University , Canada. His research focuses on high-performance large-scale data management systems with a strong theoretical and algorithmic component, including resilient systems (blockchains) , graph databases , and external-memory algorithms . He previously worked as a Postdoc Scholar at the University of California, Davis and earned his PhD from Hasselt University in Belgium. Education: Doctor of Sciences in Computer Science (2018), Hasselt University Master of Science in Computer Science and Engineering (2011), Eindhoven University of Technology His research interests include scalable resilient systems with Byzantine fault tolerance, database theory, graph query languages, constraints on graph data, and external-memory algorithms for large graph datasets. He has authored numerous high-impact publications on blockchain-based resilient systems, query optimization in graph databases, and theoretical advancements in relation algebra expressiveness. Hellings actively contributes to academic service through program committee memberships and tutorial organization, and he currently teaches courses on future resilient databases and foundational computer science topics.

Ulla Liukkunenمشاهده پروفایل

استاد

• Labour Law
• Private International Law
• Comparative Law
• +۲ مورد دیگر

Ulla Liukkunen is a Professor of Labour Law and Private International Law at the University of Helsinki's Faculty of Law. She also serves as a Docent at the University of Helsinki and is affiliated with the Helsinki Institute of Sustainability Science (HELSUS). Professor Liukkunen has held significant leadership roles including Director of the Center of Chinese Law and Chinese Legal Culture until 2022 and has been actively involved in numerous research projects funded by the Finnish Academy and other organizations. Professor Liukkunen's primary research interests focus on Labour Law, Private International Law, Comparative Law, Transnational Law, and Sustainability Law. Her work particularly examines the intersection of labour rights with international legal frameworks, with special attention to Chinese labour law and Nordic perspectives. She has made significant contributions to understanding collective bargaining systems, decent work standards, and the role of the International Labour Organization in global governance. Analysis of Professor Liukkunen's recent publications reveals a consistent focus on transnational labour governance, private international law applications to labour issues, and comparative analyses of labour law systems. Her work increasingly addresses contemporary challenges such as platform work, global value chains, and sustainability dimensions of labour regulation. There is a notable emphasis on bridging theoretical frameworks with practical policy implications, particularly in European and Chinese contexts. Professor Liukkunen has received significant recognition for her scholarly contributions: Member of the Finnish Academy of Science and Letters (2022) First Class Knight of the Order of the White Rose of Finland (2016) Professor Liukkunen has supervised numerous doctoral students and has been involved in significant research projects throughout her career. She has led Finnish Academy-funded research projects on international labour law and comparative labour law, as well as private international law. Her projects include 'Relevant Problems and Perspectives for the Development of International Private Law in Modern Conditions' (2023-2026), 'Employee Participation and Collective Bargaining in the Era of Globalization – Nordic and Chinese Perspectives' (2013-2016), and 'ILO Core Labour Standards Implementation in China: Legal Architecture and Cultural Logic' (2012-2015). Professor Liukkunen is actively involved with the Helsinki Institute of Sustainability Science (HELSUS) and has played key roles in establishing the Finnish Center of Chinese Law and Chinese Legal Culture. She has served in numerous advisory capacities including as a member of the Finnish Committee for Confirming the General Applicability of Collective Agreements, the Market Court until 2022, and as Vice Member of the Labour Court. Internationally, she serves as Vice Chair of the Mediation Board of the European Labour Authority and is a member of the European Centre of Expertise in the Field of Labour Law.

Lars Kristiansenمشاهده پروفایل

استاد

• Mathematical Logic
• Computability Theory
• Complexity Theory
• +۴ مورد دیگر

Lars Kristiansen is Professor II (part-time Professor) at the Department of Mathematics, University of Oslo . His research centres on the intersection of mathematical logic, computability theory, and computational complexity, with recent emphasis on computable analysis, weak first-order theories, subrecursive degree structures, and implicit computational complexity. Research Interests Computable Analysis: Representations and computational complexity of irrational and real numbers. Weak First-Order Theories: Decidability, interpretability and fragments of concatenation theories. Subrecursive Degree Theory: Fine structure of honest subrecursive degrees and the Grzegorczyk hierarchy. Implicit Computational Complexity: Reversible computing, type systems that capture complexity classes, and resource-bounded program analysis. Across more than 50 refereed publications since 1996, a clear trend emerges: an early focus on subrecursive hierarchies and honest degrees evolved into an intensive study of the computational content of real number representations and the logical strength of weak arithmetics. Recent work (2023-2025) deepens this agenda, analysing the complexity of converting between alternative representations of reals and the degree structures that these induce. Scientific Output While no named awards are listed, Kristiansen’s contributions are disseminated in top venues such as Bulletin of Symbolic Logic , Annals of Pure and Applied Logic , Archive for Mathematical Logic , Science of Computer Programming , and leading LNCS conferences. His work is frequently co-authored with Amir Ben-Amram, Jakob Grue Simonsen, Juvenal Murwanashyaka, Ivan Georgiev, and Neil D. Jones, indicating active collaborative networks in both logic and theoretical computer science. Research Groups & Collaborations Logic research group at the University of Oslo Data and Knowledge Management (DKM) group

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

استاد

• Mathematical Logic
• Model Theory
• Complexity Theory
• +۴ مورد دیگر

Prof. Martin Otto is a Professor of Mathematics at the Technische Universität Darmstadt, specializing in Logic and Mathematical Foundations of Computer Science. He holds a position in the Department of Mathematics (Fachbereich 4) and serves as Dean of Studies. His academic journey includes a PhD from the University of Freiburg (1990), habilitation from RWTH Aachen (1996), and prior roles as a Lecturer/Reader at Swansea University (1999–2003). Research Interests: Mathematical Logic, Model Theory, Complexity Theory, Algorithmic Model Theory, Finite Model Theory, and Logic in Computer Science. Notable contributions include work on bisimulation, guarded logics, and inquisitive semantics. His research bridges structural properties in mathematics and computational expressiveness. Teaching: Courses span Mathematical Logic, Model Theory, Linear Algebra, and Modal Logics. Recent offerings include Introduction to Mathematical Logic (2024/25), Logic & Knowledge Representation, and advanced seminars on model-theoretic topics. Publications: Over 50 peer-reviewed papers in journals like the Journal of Symbolic Logic, and conference proceedings such as LICS and CSL. Key works address guarded fragments, bisimulation invariance, and finite model theory applications. Affiliations: Member of the Logic Group at TU Darmstadt. Editorships include the Bulletin of Symbolic Logic and Lecture Notes in Logic. Organized workshops like AlMoTh 2020 (cancelled due to pandemic) and participated in Simons Institute programs (2016).

Luc Segoufinمشاهده پروفایل

استاد پژوهشی

• Database theory
• Verification
• Logic in computer science
• +۳ مورد دیگر

Luc Segoufin is a Research Professor at INRIA (French National Institute for Research in Computer Science and Automation), affiliated with the Department of Computer Science at École Normale Supérieure (ENS) in Paris. He leads the VALDA research team, focusing on theoretical computer science foundations. His research spans: Database theory: Query answering, consistency, and enumeration complexity Logic and automata: Finite model theory, automata over data structures Computational complexity: Fine-grained analysis and lower bounds Formal methods: Verification and logic-based modeling His recent publications (2022–2024) concentrate on: Dichotomy theorems for query answering under constraints Constant-delay enumeration algorithms for structured data Decidability in logic fragments over trees and graphs Connections between automata, algebra, and complexity No scientific awards are mentioned in available sources. He collaborates extensively within the VALDA team and international researchers on projects involving database theory, logic, and automata. No student advising details are provided.

Petr Golovachمشاهده پروفایل

استاد پژوهشی

• Discrete Mathematics
• Theoretical Computer Science
• Graph Theory
• +۶ مورد دیگر

Petr Golovach is a Research Professor at the Department of Informatics, University of Bergen. His research focuses on Discrete Mathematics and Theoretical Computer Science, particularly graph theory, algorithms, parameterized complexity, and clustering. He has held academic positions at Syktyvkar State University (1991–2007), Durham University (2009–2011), and currently teaches advanced courses like Advanced Algorithms Techniques and Enumeration Algorithms at the University of Bergen. His research interests include graph algorithms, parameterized complexity, matroid theory, and algorithmic enumeration. He has organized notable events like the Dagstuhl Seminar 2018 and serves on program committees for STACS, IPEC, and SWAT. Notable contributions include work on hybrid clustering algorithms, graph cuts under matroid constraints, and parameterized tractability of path and cycle problems. He has supervised PhD students like Nidhi Purohit and master’s students including Øyving Stette Haarberg and Andreas Steinvik. His publications span over 200 peer-reviewed papers in top venues such as Journal of the ACM and conferences like SODA and ICALP. His research bridges extremal combinatorics with algorithm design, emphasizing practical and theoretical advancements in graph-based problems.

Frank Wolterمشاهده پروفایل

استاد

• Knowledge Representation and Reasoning
• Logic in Computer Science
• Description Logic
• +۹ مورد دیگر

Frank Wolter is a Professor for Logic and Computation at the University of Liverpool's Department of Computer Science. His research focuses on Knowledge Representation and Reasoning, Logic in Computer Science, Description Logic, and related areas. He has held significant editorial roles, including co-editing the Handbook of Modal Logic (2007) and multiple conference proceedings. He has been recognized with numerous awards, including Best Paper Awards at KR 2000, KR 2008, KR 2010, ISWC 2013, and PODS 2017, as well as the Elected EurAI Fellow (2023). His work includes foundational contributions to ontology-based data access and query answering, with a focus on computational complexity and formal methods. Wolter has supervised multiple PhD students, including Oliver Kutz, Sebastian Bauer, and Hadrien Pulcini. He has been involved in projects funded by EPSRC (e.g., Dynamic Ontologies, Knowledge Representation and Reasoning about Distances, and quantMD), addressing challenges in combining logics and modular ontologies. He actively participates in academic events, serving on program committees for conferences like IJCAI, AAAI, and KR, and has organized workshops on topics such as Craig Interpolation and the Decision Problem in First-Order Logic.

Fabio Mogaveroمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Formal Verification
• Temporal Logic
• +۱۲ مورد دیگر

Fabio Mogavero is an Associate Professor in Theoretical Computer Science at the Department of Electrical Engineering and Information Technology, Università degli Studi di Napoli Federico II. His research spans formal specification, verification, and synthesis of systems, with a strong focus on logics, automata, games, and database theory. Ph.D. in Computer Science, Università degli Studi di Napoli Federico II, 2011 M.Eng. in Computer Science Engineering, Università degli Studi di Napoli Federico II, 2007 B.Eng. in Computer Science Engineering, Università degli Studi di Napoli Federico II, 2005 His primary research interests include formal verification, temporal and strategic logics, automata over infinite structures, decidability, and database theory—particularly bag semantics. He has made significant contributions to the theory of parity and mean-payoff games, strategy logic, and SHACL/RDF validation. His recent work explores fragments of first-order and monadic second-order logic, and he actively publishes in top venues such as LICS, ICALP, and IJCAI. The most recent articles highlight a sustained focus on logical characterizations (e.g., automata-theoretic models for temporal logics), game-solving algorithms, and foundational database theory, especially around SHACL and multiset semantics. His work bridges theoretical computer science with practical formal methods. Scientific Awards and Recognition: Erdös number at most 3 (via Erdös → J.H. Spencer → M.Y. Vardi → F. Mogavero) Fabio Mogavero has served on the program committees of major conferences including IJCAI, AAMAS, ECAI, and LICS. He has co-edited proceedings for the Strategic Reasoning (SR) and OVERLAY workshops. He has collaborated with leading researchers such as Moshe Y. Vardi, Orna Kupferman, and Michael Benedikt. He has held postdoctoral and teaching positions at the University of Oxford and Università di Verona. He is actively involved in the theoretical computer science community through conference organization and editorial work. He maintains research collaborations across Europe and the U.S. and continues to contribute to foundational and applied aspects of logic in computer science.

Jonathan Simonمشاهده پروفایل

استادیار

• Philosophy of Mind
• Metaphysics
• Meta-ethics
• +۶ مورد دیگر

Jonathan Simon is an Assistant Professor in the Department of Philosophy at the University of Montreal , specializing in philosophy of mind, metaphysics, and meta-ethics. His research spans formal ontology, philosophy of science, and value theory. Education: PhD from NYU (2012), BA from Columbia University (2002, Magna Cum Laude) Awards: MacCracken Fellowship, Humboldt Foundation Research Fellowship, Adam Leroy Jones Prize in Logic His research focuses on the metaphysics of consciousness, including pain perception, non-orientable spatial experience, and quantum mechanics ontology. Recent projects explore AI consciousness and artificial moral perception . Key publications include Experiencing Left and Right in a Non-Orientable World (forthcoming) and Fragmenting the Wave Function (2019), blending philosophy of mind with quantum theory. Supervised master’s theses address topics like machine consciousness and moral psychology . Scientific Awards: MacCracken Fellowship (2004-2009) Humboldt Foundation Fellowship (2002-2004) Adam Leroy Jones Prize (2002) He has advised graduate students on thesis topics including artificial consciousness , utilitarian axiology , and metaphysics of nothingness , with current projects funded by FRQSC , CRSH , and Good Ventures Foundation .

Yevgeny Kazakovمشاهده پروفایل

پژوهشگر ارشد

• Knowledge Representation
• Automated Reasoning
• Description Logics
• +۵ مورد دیگر

Dr. Yevgeny Kazakov is a Research Fellow at the University of Ulm's Institute of Artificial Intelligence. His work focuses on knowledge representation, automated reasoning, and ontology engineering, particularly in Description Logics and OWL. He has contributed to systems like ELK and ConDOR, emphasizing algorithm optimization and practical reasoning solutions. Education: No formal education details explicitly mentioned in the text. Research Interests: Kazakov's research centers on reasoning support for Description Logics, ontology languages (e.g., OWL), and modular integration of ontologies. He explores theoretical properties and practical implementations, including consequence-based reasoning, modularity, and algorithmic efficiency. His work also addresses challenges like SPARQL query optimization over OWL ontologies and incremental reasoning. Professional Activities: Kazakov has held roles such as General Co-chair of the Description Logic Workshop (2013), Guest Editor of the JAIR special track on Description Logics, and PC member for conferences like KR, IJCAI, and ECAI. He has reviewed for top journals and conferences, contributing to the field's academic rigor. Teaching: Recent courses include Cognitive Systems 2, Explainable AI, and Knowledge-Based AI at the University of Ulm. He also supervises projects in automated reasoning. Grants & Projects: Led the DFG-funded 'Live Ontologies' project (2012–2017). Co-investigated EPSRC-funded projects like ConDOR (2009–2011) and REOL (2005–2008). These projects focused on ontology reasoning systems and modular integration. Students: Advised Trung-Kien Tran (since 2012, with Birte Glimm) and František Simančík (2009–2013, with Ian Horrocks). Labs/Teams: Active in the Institute of Artificial Intelligence, collaborating on systems like ELK and ConDOR. His research group develops tools for efficient ontology reasoning and knowledge representation.

Christoph Weidenbachمشاهده پروفایل

استاد مدعو

• Automated Deduction
• Decision Procedures
• Theorem Proving
• +۵ مورد دیگر

Christoph Weidenbach is an Adjunct Professor in the Computer Science department at Saarland University, Germany, and the head of the research group Automation of Logic at the Max-Planck-Institute for Informatics. His work focuses on automated deduction, decision procedures, and theorem proving, particularly in the context of first-order logic and decidable fragments. He has been actively involved in the development of automated verification tools and techniques, including SAT solvers and SMT frameworks. Education: Diplom (1989), PhD (1996), Habilitation (2000), all in Computer Science at Saarland University. Current Roles: Research Leader (Automation of Logic group, MPI) since 2005; Adjunct Professor (Saarland University) since 2007. Past Roles: Research Coordinator (MPI, 1999-2005); IT Manager (GM Powertrain Europe, 1991-1999). His recent publications highlight trends in automated deduction, formal verification, and constraint solving, with applications in linear arithmetic, network protocols, and semantic web reasoning. He has also contributed to the theoretical foundations of superposition calculi and SCL(FOL) extensions.

Sen Zhengمشاهده پروفایل

پژوهشگر

• Automated Reasoning
• Formal Verification
• Theorem Proving
• +۴ مورد دیگر

Sen Zheng is a Researcher in the Autonomy and Verification group at the University of Manchester. His work focuses on formal verification for swarm robotics and applying automated reasoning techniques to real-world problems. He holds a PhD in Formal Methods from the University of Manchester (2021), an MSc from the same institution (2016), and a BEng from Northwestern Polytechnical University (2015). Education: PhD: SATURATION-BASED QUERY ANSWERING AND REWRITING PROCEDURES FOR GUARDED FIRST-ORDER FRAGMENTS (2017-2021) MSc: University of Manchester (2015-2016) BEng: Northwestern Polytechnical University (2011-2015) Research interests include automated reasoning, theorem proving, and ontology-based query answering. His work bridges theoretical logic and practical applications in robotics and knowledge representation. Recent publications explore saturation-based methods for guarded fragments and swarm robotics verification. He participates in the CRADLE project, addressing robotic autonomy in challenging environments.

Guillermo Badiaمشاهده پروفایل

مدرس ارشد

• Mathematical Logic
• Many-Valued Logics
• Substructural Logics
• +۱۱ مورد دیگر

Dr. Guillermo Badia is a Senior Lecturer in Logic at the School of Historical and Philosophical Inquiry , University of Queensland, Australia. His research spans mathematical and philosophical logic, with a focus on many-valued, substructural, and computational logics. From 2022–2025, he held the Discovery Early Career Researcher Award (DE220100544, 383,975 AUD) from the Australian Research Council. Editorial Board: Archive for Mathematical Logic and Journal of Multiple-Valued Logic and Soft Computing Academic Genealogy: Descendant of G. H. Hardy via R. Rado, K. Gravett, John N. Crossley, John L. Bell, G. Priest, Z. Weber Research Areas include: Many-valued predicate logics and residuated lattices Hybrid, modal, and weighted logic Bi-intuitionistic and relevant logic Graded model theory and non-classical metatheory Applications in computer science and database theory Scientific Contributions highlight trends in: Real-valued first-order logics and hybrid-dynamic games Frame definability and asymptotic truth-value laws Weighted complexity class characterizations Substructural consequence relations Awards : Discovery Early Career Researcher Award (DE220100544) from Australian Research Council

• Health Systems Science
• Quality Management
• Service Process Analysis
• +۵ مورد دیگر

Paul Lillrank is a Professor at the Department of Industrial Engineering and Management at Aalto University, Finland. He pioneered the application of industrial management methods to healthcare systems and co-founded the Institute of Healthcare Engineering, Management and Architecture (HEMA) and The Nordic Healthcare Group (NHG) consultancy at Aalto. Research Focus: Health Systems Science, service process analysis, knowledge integration, segmentation principles, value-based care, regional service supply systems, and frugal innovations Email: paul.lillrank@aalto.fi Notable Work: Co-author of the textbook The Logics of Healthcare – The Practitioner’s Guide to Health Systems Science (Francis & Taylor 2018) His recent research examines healthcare service design, pandemic impacts on care utilization, and care pathway disruptions. He has developed modeling languages for patient pathways and segmentation models for population-based healthcare systems. Scientific Awards: Knight, First Class, of the Order of the White Rose of Finland (granted for academic or artistic career)

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

استاد

• Computational Logic
• Dynamic Complexity Theory
• Database Theory
• +۵ مورد دیگر

Thomas Zeume is a Professor for Logic and Formal Verification at Ruhr University Bochum since 2020. Previously, he served as a Scientific Assistant at TU Dortmund's Faculty of Computer Science from 2009 to 2020. His work bridges computational logic with database theory, complexity theory, and formal verification, while also innovating in educational technologies for formal foundations of computer science. Research Focus: Dynamic Complexity Theory: Classifying logical query languages for evolving databases. Formal Verification: Designing logics for software/hardware verification and XML/graph databases. Educational Technologies: Developing the Iltis system for interactive learning in formal logic and computational reductions. Publications and Contributions: His research spans dynamic complexity, two-variable logic, and CS education tools, with key works in Journal of the ACM , LICS , and SIGCSE TS .