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

Hector Geffnerمشاهده پروفایل

استاد

• Artificial Intelligence
• Machine Learning
• Automated Planning
• +۵ مورد دیگر

Hector Geffner is an Alexander von Humboldt Professor at RWTH Aachen University, leading the Chair of Machine Learning and Reasoning. He specializes in automated planning, machine learning, and reasoning, with a focus on representation learning for acting and planning. His work bridges symbolic and model-based AI, emphasizing general policies and subgoal decomposition. Education & Background : PhD from UCLA (1989), prior roles at IBM Watson Research Center and Universidad Simón Bolívar. Former ICREA researcher and professor at Universitat Pompeu Fabra (2001–2022). Research Interests : Classical and probabilistic planning, reinforcement learning, knowledge representation, and applications in robotics. His ERC-funded RLeap project explores learning generalized policies and symbolic representations for effective decision-making. Teaching : Courses include 'Actions and Planning in AI' and 'Social and Technological Change', emphasizing interdisciplinary AI applications. Awards & Recognition : Alexander von Humboldt Professorship (2023), AAAI/EurAI Fellowships, and editor of influential works on Judea Pearl’s contributions to AI. Grants & Projects : Advanced ERC grant (2020–2025), Humboldt Foundation support, and RWTH funding for research on planning and reasoning. Labs & Teams : Heads the Chair of Machine Learning and Reasoning at RWTH, focusing on interdisciplinary research in AI, robotics, and planning algorithms.

Tobias Müllerمشاهده پروفایل

استاد

• Combinatorics
• Probability Theory
• Random Graphs
• +۵ مورد دیگر

Prof. Tobias Müller is a Professor at the Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence at the University of Groningen. His academic journey includes previous positions at Utrecht University, CWI (Centrum Wiskunde & Informatica), Tel Aviv University, and Eindhoven University of Technology, with a doctorate from the University of Oxford under Colin McDiarmid. His research focuses on combinatorics, probability theory, random graphs, percolation, discrete and stochastic geometry, and combinatorial game theory. He has contributed extensively to understanding complex networks, hyperbolic models, and geometric random structures. Research Interests: Random Graphs and Percolation Theory Discrete and Stochastic Geometry Hyperbolic Network Models Probabilistic Combinatorics Geometric Probability Graph Algorithms and Connectivity Notable Contributions: Analysis of Voronoi and Poisson-Voronoi percolation in hyperbolic planes. Studies on Mallows random permutations and their cycle structures. Research on component games and logical limit laws in graph theory. Investigations into the geometry and properties of random geometric graphs. Grants & Collaborations: Active in organizing workshops and conferences on random graphs and geometric networks, including the BIRS Workshop on Random Geometric Graphs and the STAR Workshops series. Labs/Teams: Member of the Bernoulli Institute’s research groups, focusing on stochastic studies, combinatorics, and algorithmic methods.

Gerry Bradyمشاهده پروفایل

استاد بالینی

• Mathematical Logic
• History of Mathematics
• Categorical Logic
• +۳ مورد دیگر

Gerry Brady is a Clinical Professor in the Masters Program in Computer Science at the University of Chicago. He holds a Ph.D. in Mathematical Logic from the University of Oslo (1997), an M.A. in Mathematical Logic from the University of Chicago, and a B.A. in Mathematics with honors from the same institution. His research focuses on the history and foundations of mathematical logic, particularly the contributions of figures like C.S. Peirce and Thoralf Skolem. Notably, his doctoral thesis was expanded into the 2000 book From Peirce to Skolem , published by Elsevier. Brady has authored or co-authored works on categorical logic, relational calculus, and the philosophical underpinnings of symbolic logic. He contributed to pioneering efforts in computerizing academic journal production at the University of Chicago Press in the 1990s. His teaching emphasizes problem-solving skills, which he links to workplace success for MPCS graduates. He currently holds an office in Crerar Library and can be reached at brady@cs.uchicago.edu.

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.

Pavel Panchekhaمشاهده پروفایل

استادیار

• Programming Languages
• Program Synthesis
• Verification
• +۴ مورد دیگر

Pavel Panchekha is an Assistant Professor in the School of Computing at the University of Utah, where he holds the Warnock Chair for Junior Faculty. His research spans programming languages, web browsers, and numerical analysis, with a focus on developing programming language techniques to address challenges across computer science. Dr. Panchekha received his educational training at prestigious institutions: PhD in Computer Science from the Paul G. Allen School for Computer Science and Engineering at the University of Washington, advised by Michael D. Ernst and Zachary Tatlock BS in Mathematics from MIT Panchekha's research program has two major thrusts. First, he works on web browser internals , with projects including fuzzing layout invalidation, multi-tenant garbage collection, and optimizing 2D graphics. He is also authoring a textbook on web browsers that informs much of this research. Second, he focuses on automatic numerical analysis , with projects such as automatic accuracy improvement, synthesis via term rewriting, scalable static accuracy analysis, and math library implementation. He leads the FPBench and Herbie projects, which are major deployments of his research. His scholarly output demonstrates consistent contributions across programming languages, verification, and numerical methods. Recent work shows a growing emphasis on bidirectional typing systems, layout invalidation in browsers, and robust floating-point error analysis. His publications reveal a trajectory from foundational work on floating-point accuracy (notably the Herbie tool that won a Distinguished Paper Award at PLDI 2015) toward more comprehensive systems for program synthesis, verification, and browser optimization. Panchekha has received significant recognition for his research contributions: NSF Fellowship ARCS Foundation Fellowship Adobe Research Fellowship Wissner-Slivka Foundation Fellowship 2015 PLDI Distinguished Paper Award for work on the Herbie numerical analysis and repair tool As an advisor, Panchekha mentors a substantial group of students across multiple levels. He currently advises six students: Marisa Kirisame (PhD), Bhargav Kulkarni (PhD), Yumeng He (PhD), Artem Yadrov (MS), Jesus Ponce (BS), and Jonas Regehr (BS). Previously, he has advised over twenty students including PhD candidates like Ian Briggs and numerous MS and BS students. His advising spans theoretical topics in programming languages and practical applications in web browsers and numerical computing. Panchekha leads research groups focused on programming languages applications to web browsers and numerical analysis. His work on the Herbie tool for floating-point accuracy improvement has become influential in the programming languages community, and his more recent work on browser internals is shaping how researchers understand and optimize modern web rendering engines. He is currently developing a textbook on web browsers that aims to synthesize knowledge about browser architecture and implementation.

Victor Vianuمشاهده پروفایل

استاد

• Computational Logic
• Database Systems
• Database Theory
• +۴ مورد دیگر

Victor Vianu is a Professor of Computer Science and Engineering at the University of California, San Diego and holds the INRIA International Chair at INRIA-Saclay in Paris. He has maintained continuous faculty status at UC San Diego since 1983 while developing extensive international collaborations, particularly with French research institutions including INRIA, ENST-Paris, ENS-Paris, and the University of Paris. His academic credentials include a Ph.D. in Computer Science from the University of Southern California (1983) and undergraduate studies in Mathematics and Informatics at the University of Bucharest (1974-1977). Professor Vianu's research spans computational logic, database systems and theory, and automatic verification. His work uniquely bridges theoretical foundations with practical applications in XML processing, workflow systems, and data-driven applications. He has made seminal contributions to understanding the theoretical underpinnings of database query languages and their expressive power, particularly in the context of XML technologies and workflow systems. His research demonstrates a consistent trajectory from theoretical computer science to practical database systems applications. His publication record reveals significant contributions to database theory spanning over three decades, with particular emphasis on XML technologies, workflow systems, and formal methods for data-driven applications. His work shows a clear evolution from foundational theoretical work to practical applications in business processes and web technologies. INRIA International Chair (2013) Fellow of the American Association for the Advancement of Science (AAAS) (2013) ACM PODS Alberto O. Mendelzon Test-of-Time Award (2010) Fellow of the Association for Computing Machinery (ACM) (2006) Professor Vianu has held significant leadership roles including Editor-in-Chief of the prestigious Journal of the ACM, numerous program committee chair positions for major database conferences (PODS, ICDT, ASIAN), and General Chair for ACM SIGMOD conferences. He has served on the executive committees of SIGMOD (1998-2000) and PODS (1993-2004), and was a member of the ICDT Council (1997-2007), demonstrating sustained influence in the theoretical database community. His extensive invited talks at major conferences including College de France, ACM PODS, and International Conference on Database Theory highlight his international recognition.

Saharon Shelahمشاهده پروفایل

استاد

• Model theory
• Axiomatic set theory
• Applications of logic in algebra
• +۲ مورد دیگر

Saharon Shelah is an Israeli mathematician renowned for his groundbreaking work in mathematical logic and set theory. He currently holds the Robinson Chair for Mathematical Logic at Hebrew University, a position he has held since 1978, and has been a Professor at Hebrew University since 1974. Additionally, he serves as a Distinguished Visiting Professor at Rutgers University since 1986. His educational background includes: B.Sc. from Tel Aviv University (1964) M.Sc. from Tel Aviv University (1967) M.Sc. from Hebrew University (1968) Ph.D. from Hebrew University of Jerusalem (1969), summa cum laude, supervised by Michael Rabin Shelah's research primarily focuses on mathematical logic, particularly model theory and set theory. His work has revolutionized these fields through the development of stability theory, PCF theory, and proper forcing. He has made significant contributions to understanding the connections between logic and other mathematical disciplines including algebra, computer science, and combinatorics. His approach often involves creating general frameworks that solve multiple problems simultaneously, demonstrating extraordinary depth and breadth in mathematical thinking. An analysis of Shelah's extensive publication record reveals consistent innovation across mathematical logic. His work shows a progression from foundational model theory in the 1970s through the development of stability theory, to groundbreaking set theory results in the 1980s and 1990s, particularly in cardinal arithmetic and PCF theory. Recent publications continue to expand abstract model theory while finding new applications across mathematics. His research demonstrates remarkable consistency in quality and originality over five decades. Shelah's exceptional contributions have been recognized with numerous prestigious awards: 2013 AMS Steele Prize 2011 EMET Prize in Mathematics 2001 Wolf Prize in Mathematics 2000 Bolyai Prize 1998 Israel Prize for Mathematics 1992 SIAM George Pólya Prize 1991 Honorary Foreign Member of the American Academy of Arts and Sciences 1988 Member of the Israel Academy of Sciences and Humanities 1983 Karp Prize 1982 Rothshild Prize 1977 Erdös Prize Throughout his career, Shelah has mentored numerous students and collaborated with over 200 coauthors. His research has been supported by multiple grants from prestigious organizations including the Israel Science Foundation and the National Science Foundation. Shelah's work has fundamentally shaped modern mathematical logic, with his classification theory providing frameworks that continue to guide research directions. His ability to connect seemingly disparate areas of mathematics through logical structures has made his contributions exceptionally influential. Shelah maintains an active research group at Hebrew University, where he continues to supervise doctoral students and postdoctoral researchers. His research program, known for its depth and technical sophistication, continues to generate new directions in mathematical logic. The Shelah Archive (http://shelah.logic.at) serves as a comprehensive repository of his extensive publication record, which surpassed 1190 papers by the end of 2024.

Dmitriy Traytelمشاهده پروفایل

دانشیار

• Logic
• Automata Theory
• Runtime Verification
• +۷ مورد دیگر

Dmitriy Traytel is an Associate Professor at the University of Copenhagen's Department of Computer Science since August 2020, where he currently heads the Software, Data, People & Society (SDPS) section. Prior to this position, he worked as a senior researcher (Oberassistent) in the Information Security Group led by David Basin at ETH Zürich. He completed his PhD at TU München under Tobias Nipkow's supervision in 2015. His research focuses on formal methods, particularly logic, automata theory, runtime verification and monitoring, decision procedures, (co)induction and (co)recursion, and interactive theorem proving. Traytel develops formally verified tools for runtime monitoring including VeriMon, TimelyMon, and WhyMon, emphasizing correctness and efficiency in monitoring complex temporal properties. His recent publications (2021-2025) demonstrate a strong focus on first-order temporal logic monitoring, with particular attention to explainable verdicts, scalable parallel implementations, and formal verification of monitoring algorithms. The work spans theoretical foundations in logic and category theory while maintaining practical applications in runtime verification systems. Distinguished Paper Award at POPL 2025 for 'Barendregt Convenes with Knaster and Tarski' Best Student Paper Award at FSCD 2016 Distinguished Paper Award at ATVA 2018 Traytel has supervised numerous PhD, Master's, and Bachelor's students in areas spanning formal verification, runtime monitoring, and theorem proving. His research has been supported through collaborations with major institutions including ETH Zürich and TU München. He actively contributes to the academic community by serving on program committees for major conferences including ITP 2025 and RV 2025. He leads the Software, Data, People & Society section at the University of Copenhagen, focusing on developing formally verified tools for runtime verification that bridge theoretical computer science with practical applications in security and system monitoring.

Timothy Williamsonمشاهده پروفایل

استاد

• Epistemology
• Metaphysics
• Philosophy of Language
• +۳ مورد دیگر

Timothy Williamson is a prominent Professor of Philosophy at the University of Oxford, holding the prestigious Wykeham Professorship of Logic. His academic career spans several decades with continuous contributions to analytic philosophy, particularly in epistemology, metaphysics, and philosophical logic. His work has positioned him as one of the leading philosophers of his generation. Williamson's research interests concentrate on epistemology (particularly his influential knowledge-first approach), metaphysics, philosophy of language, and philosophical logic. His work on vagueness champions epistemicism—the view that vague predicates have sharp boundaries that we cannot know. His book Knowledge and its Limits revolutionized epistemological thinking by placing knowledge rather than belief at the center of epistemological theory. Williamson has also made significant contributions to modal metaphysics, higher-order thought, and the philosophy of logic. His publication record reveals consistent engagement with foundational philosophical problems across several decades. His most recent work continues his exploration of knowledge-first epistemology while expanding into moral epistemology and methodological questions in philosophy. Williamson's articles demonstrate a distinctive blend of logical precision and philosophical depth, often using formal methods to address traditional philosophical problems. His work frequently intersects with debates in philosophy of language, metaphysics, and philosophical methodology. Williamson has been actively engaged in scholarly debate through numerous replies to critics, demonstrating his commitment to rigorous philosophical dialogue. His publications span major philosophy journals including Synthese , Canadian Journal of Philosophy , Analysis , and Philosophy and Phenomenological Research . Throughout his career, Williamson has mentored numerous graduate students and collaborated with leading philosophers across the globe. His methodological approach emphasizes the value of formal modeling in philosophical inquiry, arguing that philosophy can benefit from the model-building approaches common in natural sciences.

Grant Weddellمشاهده پروفایل

دانشیار

• Database Technology
• Real-Time Applications
• Schema Management
• +۵ مورد دیگر

Grant Weddell is an Associate Professor in the David R. Cheriton School of Computer Science at the University of Waterloo. His research focuses on database technology for real-time applications, including large-scale schema management, information clustering, dependency theory, and query optimization for heterogeneous data sources. He teaches courses such as CS338 (Introductory Databases), CS348 (Advanced Databases), CS446 (Software Engineering), and CS848 (Advanced Database Systems). His research interests emphasize the interplay between description logics and database systems, particularly in optimizing query processing and managing complex schemas. Recent work explores path agreements, functional dependencies, and ontology-mediated querying to enhance data integration and schema management efficiency. Teaching responsibilities include foundational database courses (CS338/348), software engineering (CS446), and advanced topics in information integration (CS848). No scientific awards are explicitly listed, though his contributions to database theory and optimization are extensive.

David A. Plaistedمشاهده پروفایل

استاد پژوهشی

• Mechanical theorem proving
• Term rewriting systems
• Logic programming
• +۳ مورد دیگر

David A. Plaisted is a Research Professor in the Department of Computer Science at the University of North Carolina at Chapel Hill. He joined UNC-Chapel Hill as a full professor after serving on the faculty of the Computer Science Department at the University of Illinois at Urbana-Champaign until 1984. His academic career spans several decades with significant contributions to automated reasoning and computational logic. Bachelor's degree in Mathematics from the University of Chicago (1970) Ph.D. in Computer Science from Stanford University (1976) Professor Plaisted's research focuses on mechanical theorem proving, term rewriting systems, logic programming, and algorithms. His work in term-rewriting systems investigates methods of combining them with first-order theorem provers, including techniques for applying efficient permutation group algorithms to equational theorem proving. In mechanical theorem proving, he has developed a sequence of methods including clause linking with semantics and ordered semantic hyper-linking. His research in logic programming includes developing tests to eliminate the occurrence check in Prolog while maintaining semantics. His work spans theoretical foundations to practical applications in program verification and generation. His recent publications demonstrate continued innovation in automated reasoning, particularly in semantic guidance for theorem proving. His work shows a consistent focus on improving the efficiency and effectiveness of automated deduction systems, with recent contributions to SGGS (Semantically-Guided Goal-Sensitive) theorem proving and analysis of the relationship between semantics and unification in proof systems. Professor Plaisted has served on numerous program committees and editorial boards including the Journal of Symbolic Computation, Information Processing Letters, Mathematical Systems Theory, and Fundamenta Informaticae. He is currently on the editorial board of ACM Transactions on Computational Logic and the electronic Journal of Functional and Logic Programming. He has organized significant conferences including serving as co-chair of the Second International Conference on Rewriting Techniques and Applications in 1987. He has spent several sabbaticals at prestigious institutions including SRI in Menlo Park (1982-1983), the Max-Planck Institute and University of Kaiserslautern in Germany (1993-1994), and research visits to groups in Grenoble and Nancy, France (1998).

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

استاد

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

Thomas Scanlon is Professor of Mathematics at the University of California, Berkeley and serves as Vice-Chair for Graduate Affairs in the Berkeley Senate. He is additionally affiliated with the campus-wide Group in Logic and the Methodology of Science. His research lies at the intersection of mathematical logic and number theory, with a focus on model theory and its applications to diophantine geometry, difference and differential algebra, and arithmetic dynamics. Education S.B., University of Chicago, 1993 Ph.D., Harvard University, 1997 Research Interests Scanlon’s work centers on model theory , especially o-minimality , stability theory , and geometric model theory . He applies these logical tools to problems in diophantine geometry such as the André–Oort and Zilber–Pink conjectures, studies difference and differential algebraic structures, and investigates arithmetic dynamics of rational maps and Drinfeld modules. Publications Overview Since 1997 he has authored or co-authored more than sixty research papers. Recurring themes include the model theory of valued and difference fields, jet and prolongation spaces, effective bounds in diophantine problems, and functional transcendence results. Recent work (2018-2025) explores differential Chow varieties, strong minimality of modular functions, effective elimination procedures for differential-difference equations, and uniformity questions in diophantine geometry. Doctoral Supervision Scanlon has supervised at least sixteen Ph.D. theses at UC Berkeley, covering pure model theory, diophantine geometry, differential algebra, and stability theory. Students graduated between 2002 and 2022 include Alice Medvedev, Dragos Ghioca, Alex Kruckman, and Benjamin Castle. Contact & Office Email: scanlon@math.berkeley.edu Office: 723 Evans Hall, UC Berkeley Phone: (510) 642-3665

Tej Chajedمشاهده پروفایل

استادیار

• Formal verification of systems software
• Concurrent systems verification
• Crash-safe file systems
• +۵ مورد دیگر

Tej Chajed is an Assistant Professor in the Department of Computer Science at the University of Wisconsin-Madison, where he conducts research in formal verification of systems software. His work focuses on building and proving the correctness of critical systems, particularly file systems and concurrent software. Dr. Chajed earned his PhD from MIT in the PDOS group, followed by a one-year postdoc at VMware Research before joining UW-Madison. His academic journey reflects a strong commitment to bridging theoretical formal methods with practical systems implementation. Chajed's research centers on formal verification techniques for systems software, with particular emphasis on concurrent and crash-safe systems . His work aims to eliminate bugs in critical software through mathematical proofs of correctness. Key contributions include DaisyNFS (a verified concurrent file system), the Perennial framework for reasoning about crash safety, and Goose for connecting proofs to Go code. His research spans the intersection of programming languages, operating systems, and formal methods, developing practical tools that bring verification to real-world systems. His recent publications demonstrate a consistent trajectory toward more practical and scalable verification techniques for increasingly complex systems. The research shows progression from foundational verification frameworks to applied work on specific systems like file systems, journaling, and distributed protocols. A notable trend is the focus on making verification more accessible and practical for systems developers, bridging the gap between theoretical formal methods and real-world software engineering. Dr. Chajed serves on numerous program committees including OSDI 2025 PC, PLDI 2024 PC, SySDW 2023 PC, ECOOP 2023 ERC, CPP 2023 PC, POPL 2023 PC, PLDI 2022 PC, POPL 2022 AEC, EuroDW 2021 PC, POPL 2021 AEC, PLDI 2020 AEC, POPL 2020 AEC, and SOSP 2019 AEC, reflecting his standing in the systems and programming languages research community. In teaching, Chajed has developed and instructed courses on systems verification, operating systems, and protocol verification. He previously helped create MIT's 6.826 (Principles of Computer Systems) during his PhD. His passion for technical communication was cultivated during his time as a Communication Fellow in the EECS Communication Lab at MIT, where he continues to offer guidance to students on writing and presentation skills. His research group at UW-Madison focuses on advancing the state of the art in systems verification, with current projects centered around practical verification frameworks for concurrent and crash-safe systems.

• Computational Logic
• Declarative Logic Programming
• Answer-Set Programming
• +۵ مورد دیگر

Hans Tompits is an Associate Professor in the Department of Knowledge-Based Systems at Technische Universität Wien (Vienna University of Technology). His research focuses on computational logic, declarative logic programming, and formal methods, with a particular emphasis on Answer-Set Programming (ASP). He coordinates the Master's program in Logic and Computation and leads projects in areas such as formal methods for optimization, fault-tolerant autonomous systems, and algorithmic composition. His work bridges theoretical advancements with practical applications, including tools like SeaLion (an ASP IDE with debugging support) and dlvhex (an ASP-based semantic web reasoner). He has contributed to foundational topics like program equivalence, debugging techniques, and integration of ASP with external systems. His recent projects address challenges in autonomous vehicle architectures, music composition algorithms, and safety-critical system design. Tompits has published extensively on topics ranging from nonmonotonic reasoning and modal logics to the development of declarative programming tools. His interdisciplinary approach spans computer science, mathematics, and AI, with applications in both academic and industrial contexts.

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

دانشیار

• Programming Languages
• Software Engineering
• Artificial Intelligence
• +۸ مورد دیگر

Martin Henz is an Associate Professor at the National University of Singapore , affiliated with the School of Computing and its Department of Computer Science . His academic journey includes an M.Sc. in Computer Science from Stony Brook University (1993) and a Dr.rer.nat. in Computer Science from Saarland University (1997). He has also worked as a Research Scientist at the German Research Centre for Artificial Intelligence. Research Focus : Scalable Experiential Learning, Systems for Teaching/Learning, AI in Education, Programming Languages, Algorithms, and Constraint Programming. Key Projects : Source Academy (immersive programming environment), Deep Teaching (LMS enhancements), and NUS Seafarers (maritime experiential learning). Publications span education technology, programming languages, and sustainable engineering, with recent works focusing on JavaScript-based pedagogy, automated question generation, and electric vehicle conversions. He supervised Rahul Singhal 's PhD, leading to the educational startup Cerebry, and co-founded Workforce Optimizer Pte Ltd with Alan Sevugan. Awards : NUS Annual Digital Education Award (2021) NUS Annual Teaching Excellence Award (2016/17) Fulbright Scholarship (1990) Startup @ Singapore Champion (2001)