Satisfiability (SAT) Solving Professors and Supervisors | ApplySharif

Find Academic Supervisors

Find and connect with academic supervisors, professors, and scholars for your research journey.

Showing 1-15 of 131 supervisors

Profile data may be stale. It is sourced from public faculty pages.

Kuldeep S. MeelView profile

Associate Professor

University of TorontoCanada

Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.

Official University Profile

Leslie Ann GoldbergView profile

Professor

University of OxfordUnited Kingdom

Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.

Official University Profile

Uzi VishkinView profile

Professor

University of Maryland, College ParkUnited States

Uzi Vishkin is a Professor at the University of Maryland's Institute for Advanced Computer Studies (UMIACS) and Department of Electrical and Computer Engineering, with additional affiliation in the Department of Computer Science. His work focuses on parallel computing, including the PRAM-On-Chip vision to bridge parallel algorithms and hardware. He holds a D.Sc. from Technion (1981), M.Sc. and B.Sc. in Mathematics from Hebrew University (1975/1974). Research interests span parallel algorithms, PRAM (Parallel Random Access Machine) architecture, machine learning applications, and pattern matching. His PRAM-On-Chip project aims to create a coherent computing stack for many-core processors. Vishkin has contributed to theoretical foundations and practical implementations, including the XMT architecture and compiler. He has been recognized with ACM Fellow (1996), Highly Cited Researcher (2003), and National Academy of Inventors Fellow (2024). Awards highlight his pioneering work in parallel algorithms and computing systems. Teaching spans courses like Parallel Algorithms and Mathematical Foundations for Computer Engineering. He emphasizes parallel algorithmic thinking in education and has developed teaching materials for high school and university levels. Key projects include the XMT architecture, simulations, and tools for parallel programming. His work integrates algorithmic theory with hardware design to address programming challenges in many-core systems.

Official University Profile

Albert AtseriasView profile

Professor

Polytechnic University of CataloniaSpain

Albert Atserias is a Professor in the Department of Computer Science at the Universitat Politècnica de Catalunya (UPC), affiliated with the Faculty of Informatics of Barcelona (FIB) and the ALBCOM research group (Algorithms, Bioinformatics, Complexity, and Formal Methods). He is also associated with the Institut de Matemàtiques de la UPC-BarcelonaTech. His research is central to theoretical computer science, with a strong emphasis on logic and complexity. Atserias's research interests span Computational Complexity, Logic in Computer Science, Finite Model Theory, Proof Complexity, and Constraint Satisfaction Problems . His work explores the fundamental limits of computation, the expressive power of logical languages over finite structures, and the complexity of proving mathematical statements. He investigates the algebraic and combinatorial properties of proof systems, the limits of efficient algorithms for constraint solving, and the theoretical foundations of databases. His research often bridges logic, algebra, and combinatorics to provide deep insights into computational phenomena. The trends in his recent publications show a sustained focus on the logical and algebraic underpinnings of computational problems. Key themes include the consistency and complexity of database queries , the power and limitations of proof systems (like resolution and sum-of-squares), and the expressive power of homomorphism counts in graph theory. His work on the hardness of automating resolution and the development of circular proof systems are particularly significant contributions to proof complexity. The 2024 PODS Best Paper Award for work on relational consistency underscores the impact and timeliness of his research. Among his notable scientific awards are the prestigious ICREA Acadèmia , the PODS 2024 Best Paper Award , the Premi Extraordinari de Doctorat (Extraordinary Doctoral Prize), and the Kleene Award for Best Student Paper . These accolades reflect both the excellence of his early work and his continued leadership in the field. Atserias has been a principal investigator on numerous competitive research projects, including funding from the European Research Council (ERC) and the Spanish Ministry of Science. He has advised doctoral students, such as Toni Hakoniemi, whose thesis on proof complexity he supervised. His extensive collaborative network includes leading researchers like Phokion Kolaitis, Anuj Dawar, and Victor Dalmau. He has also served on the scientific committees of major conferences, contributing to the academic community. He is a core member of the ALBCOM research group , a leading team at UPC focused on theoretical aspects of computer science, which provides a vibrant environment for research in algorithms, complexity, and formal methods. His work is also connected to the broader Institut de Matemàtiques de la UPC, fostering interdisciplinary collaboration between computer science and mathematics.

Official University Profile

Sharad MalikView profile

Professor

Princeton UniversityUnited States

Sharad Malik is the George Van Ness Lothrop Professor of Engineering at Princeton University's Department of Electrical and Computer Engineering. His research focuses on designing functionally correct and secure computing systems, combining system design with mathematical modeling for verification. He pioneered the Instruction-Level Abstraction (ILA) model for SoC verification and has contributed extensively to Boolean satisfiability (SAT) solvers. Education: PhD (1990), M.S. (1987) in Computer Science from UC Berkeley; B.Tech. (1985) in Electrical Engineering from IIT Delhi. Research Interests: Formal Verification of Digital Systems Hardware Security and Trust Boolean Satisfiability Solvers System-on-Chip (SoC) Design Accelerator-rich Platform Architectures Notable Achievements: IEEE CEDA A. Richard Newton Technical Impact Award (2017) 2013 IEEE/ACM DAC Most Cited Paper Award Princeton President’s Distinguished Teaching Award (2009) Advising & Labs: Leads the Malik Group, advising over 50 graduate students and postdocs. Active in postdoc recruitment and mentorship programs.

Official University Profile

John WawrzynekView profile

Professor

University of California, BerkeleyUnited States

John Wawrzynek is a Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He is affiliated with the Department of Electrical Engineering and Computer Sciences in the College of Engineering and serves as Co-Director of the Berkeley Wireless Research Center and Co-PI of the CONIX Research Center, one of the six centers in the Joint University Microelectronics Program sponsored by DARPA. Dr. Wawrzynek received his B.S. in Electrical Engineering from SUNY, Buffalo (1977), M.S. in EE from the University of Illinois, Urbana/Champaign (1979), and Ph.D. in Computer Science from Caltech (1987). Before joining the Berkeley faculty in 1988, he worked as a consultant at Schlumberger Palo Alto Research. His research focuses on Computer Architecture, Reconfigurable Computing, Wireless Systems, and Integrated Circuit and System Design . His work spans both theoretical foundations and practical implementations, with particular emphasis on FPGA-based computing systems, reconfigurable architectures, and wireless communication systems. His research group has made significant contributions to the field of reconfigurable computing, including the development of the Garp architecture and various tools for reconfigurable computing systems. Analysis of his recent publications (2022-2025) reveals continued focus on reconfigurable computing, FPGA design, wireless networking, and formal methods for hardware verification. His work shows an evolution from traditional computer architecture towards specialized hardware acceleration, machine learning for EDA, and wireless systems research, with particular emphasis on SAT sampling, differentiable computing, and efficient FPGA implementation of neural networks. DAC's Most Influential Paper Award (2025) NSF Presidential Young Investigator (PYI) (1989) Charles Lee Powell Fellowship (1985) NASA Certificate of Recognition (1983) Rensselaer Engineering and Science Medal (1975) Professor Wawrzynek has advised numerous graduate students throughout his career, many of whom have gone on to prominent positions in both industry and academia including Google, Xilinx, and MIT Lincoln Laboratory. His research has been supported by various grants from NSF, DARPA, and industry partners. He leads the Berkeley Wireless Research Center, which focuses on next-generation wireless communication systems and technologies, and is actively involved in the CONIX Research Center which explores connected intelligence at the network's edge.

Official University Profile

Omar RifkiView profile

Associate Professor

University of the Littoral Opal CoastFrance

Omar Rifki is an Associate Professor (Maître de Conférences) specializing in combinatorial optimization and artificial intelligence applications. His research bridges theoretical computer science with practical logistics challenges, focusing on routing problems, process mining, and machine learning integration for complex decision systems. His core research interests include phase transitions in NP-hard problems, vehicle routing optimization under time constraints, and healthcare process modeling. Rifki's work demonstrates a consistent pattern of integrating reinforcement learning with traditional optimization techniques to solve large-scale real-world problems in transportation and logistics, with particular emphasis on spatio-temporal data effects and collaborative systems. Analysis of his 15 publications (2019-2025) reveals three dominant research thrusts: (1) Fundamental studies of combinatorial problem hardness using phase transition frameworks, (2) Practical applications of deep reinforcement learning in vehicle routing and taxi assignment, and (3) Healthcare process optimization through advanced process mining techniques. His work consistently addresses scalability challenges in real-world implementations while maintaining theoretical rigor. No scientific awards were documented in the provided materials. His collaborative work with researchers like Christine Solnon and Thierry Garaix indicates active participation in European operations research communities, though specific grant details remain unreported. Rifki's research shows increasing integration of graph theory and machine learning in transportation applications, particularly evident in his Lyon City case studies on autonomous ride-sharing systems.

Official University Profile

Xujie SiView profile

Assistant Professor

University of TorontoCanada

Xujie Si is an Assistant Professor in the Department of Computer Science at the University of Toronto. He is also a faculty affiliate at the Vector Institute and an affiliate member at Mila - Quebec AI Institute, holding a Canada CIFAR AI Chair. Previously, he served as an Assistant Professor at McGill University's School of Computer Science. Education: Ph.D., Computer and Information Science, University of Pennsylvania (advised by Mayur Naik) M.S., Computer Science, Vanderbilt University B.E. (with Honors), Nankai University Research Focus: His work bridges AI and program reasoning, emphasizing the integration of statistical and logical methods. Key areas include: Static analysis and verification using deep learning/reinforcement learning Neuro-symbolic systems for urban simulation (e.g., LogiCity) Automated theorem proving via LLMs and symbolic reasoning Program repair and compiler fuzzing Recent Article Trends: Recent work focuses on synergizing LLMs with symbolic reasoning (e.g., Olympiad inequality proving), advancing SAT solving with graph neural networks, and applying neuro-symbolic methods to Euclidean geometry formalization. Awards: Canada CIFAR AI Chair (2023) Lab/Teams: Leads research teams exploring program analysis, neuro-symbolic AI, and formal verification at the University of Toronto and Vector Institute.

Official University Profile

Martin MüllerView profile

Professor

University of AlbertaCanada

Martin Müller is a Professor in the Department of Computing Science at the University of Alberta, where he conducts research in artificial intelligence, game theory, and heuristic search. He holds the Canada CIFAR AI Chair at Amii and is an Amii Fellow, underscoring his leadership in AI. His research group focuses on Monte Carlo tree search, reinforcement learning, combinatorial game theory, and automated planning, with applications in games such as Go, Hex, and NoGo. His research interests span Monte Carlo and exact methods in game-tree search , exploration in heuristic search and machine learning , and algorithms in combinatorial game theory . He has developed open-source software like MCGS (Minimax-based Combinatorial Game Solver) and contributes to game-playing systems such as Fuego for Go. His work bridges theoretical foundations with practical implementations in AI-driven game solvers. Recent publications show a strong trend in reinforcement learning , particularly in deep Q-learning, policy gradient methods, and anomaly detection in deep RL. His team also explores combinatorial game solving , sparse reward environments , and imperfect information games . The research integrates machine learning with classical AI techniques, emphasizing empirical validation and algorithmic innovation. Canada CIFAR AI Chair Amii Fellow Best student paper award at IEEE Conference on Games 2024 Best paper award at IEEE COG 2021 Outstanding paper award at AAAI-18 Faculty of Science Dissertation Award (2016) Dissertation Award from the Canadian Artificial Intelligence Association (2013) Müller has supervised numerous PhD and MSc students, including Hongming Zhang, Henry Du, and Timo Bertram, many of whose theses focus on game AI, reinforcement learning, and combinatorial optimization. He is funded by NSERC, Mitacs, and Compute Canada. His group collaborates on projects involving neural networks for game playing, SAT solving, and planning algorithms. He is currently on sabbatical but remains academically active, teaching a graduate course on combinatorial games in 2025 and hosting visiting researchers. His lab is involved in the development of MCGS, a solver for sum games, and contributes to open-source AI software. The team publishes regularly in top venues such as NeurIPS, ICML, AAAI, and IEEE Transactions on Games. Future work includes advancing combinatorial game solvers, improving deep RL robustness, and exploring generalization in game representations.

Official University Profile

Fahiem BacchusView profile

Professor

University of OrléansFrance

Fahiem Bacchus is a Professor in the Department of Computer Science at the University of Toronto, within the Faculty of Arts and Science. His research is centered on foundational problems in Artificial Intelligence, particularly in reasoning, representation, and algorithm design. Institution: University of Toronto School: Faculty of Arts and Science Department: Department of Computer Science Email: fbacchus@cs.toronto.edu His work spans key areas including constraint satisfaction, satisfiability (SAT), automated planning, Bayesian inference, and constraint optimization. He focuses on developing algorithms that exploit domain-specific knowledge and structural properties to improve performance. His research has led to significant contributions such as the TLPlan planning system, which won the AIPS2002 international planning competition, and the 2clseq SAT solver, which demonstrated that extensive binary clause reasoning can dramatically improve solver efficiency. His work on preprocessors like Hypre further advanced formula simplification techniques. The recent articles reflect a strong focus on improving search algorithms through richer reasoning mechanisms, particularly in SAT solving and non-clausal logic. His publications show a consistent trend toward enhancing DPLL-based solvers with advanced inference techniques, reducing search space through preprocessing, and leveraging structural knowledge in logical theories. No scientific awards are explicitly mentioned in the provided text. Bacchus has supervised research and developed educational materials, with involvement in teaching and academic conference organization. While specific grants are not listed, his software releases (2clseq, Hypre, NoClause) suggest externally supported research activity. He has contributed tutorials, talks, and online teaching resources, indicating an active role in academic dissemination and mentoring. His research group has produced several software systems available for non-commercial research use, including 2clseq, Hypre, and NoClause, reflecting a strong applied and experimental component to his work. These tools are used in SAT solving, preprocessing, and non-clausal reasoning, and are documented with detailed technical information and usage instructions.

Official University Profile

Ruben MartinsView profile

Assistant Professor

Max Planck Institute for InformaticsGermany

Ruben Martins is an Assistant Professor at Carnegie Mellon University's School of Computer Science and serves as the program director of the Master of Science in Computer Science (MSCS) . His research focuses on the intersection of constraint programming, program synthesis, analysis, and verification, with recent work aiming to make formal methods tools more accessible through automated reasoning. Ruben earned his Ph.D. with honors from the Technical University of Lisbon, Portugal (2013) , followed by postdoctoral research at the University of Oxford (2014-2015) and UT Austin (2015-2017) . Research Interests : Ruben's work bridges constraint programming and program synthesis , with applications in software verification , optimization , and automated reasoning . He has developed award-winning tools like Open-WBO , a modular MaxSAT solver that has won gold medals in international competitions. His publications span top-tier venues such as POPL , PLDI , FSE , SAT , and CP , often addressing real-world challenges from program analysis to network security. Scientific Awards include: Distinguished Paper Award at PLDI 2018 Distinguished Paper Award at FSE 2021 Distinguished Paper Award at SAT 2022 Gold medals for Open-WBO in MaxSAT competitions Teaching & Advising : Ruben mentors Ph.D., Master’s, and undergraduate students in research projects related to program synthesis, formal methods, and constraint solving. He teaches courses such as Bug Catching: Automated Program Verification and Advanced Topics in Logic: Automated Reasoning and Satisfiability , emphasizing hands-on experience with tools like Why3. His advising spans topics from AI-driven program repair to network protocol verification , fostering collaboration across disciplines.

Official University Profile

David A. D. TompkinsView profile

Associate Professor

University of WaterlooCanada

Dave Tompkins is an Associate Professor in the David R. Cheriton School of Computer Science at the University of Waterloo. He holds a PhD in Computer Science and a MASc in Electrical Engineering from the University of British Columbia, along with a BESc and BSc from Western University. His primary research focuses on Stochastic Local Search (SLS) algorithms for the Satisfiability Problem (SAT) and MAX-SAT. Research Interests: His work spans Stochastic Local Search Algorithms SAT and MAX-SAT problem solving Dynamic Local Search techniques Heuristic algorithm design and optimization Data compression and image coding Genetic algorithms and game theory Scientific Awards: He has received Best Paper Award (2006, CCAI) Best Poster Awards (2003, ASI; 1999, ASI) Gold and Silver Medals in SAT Competitions (2004) Incomplete Solver Track Awards (2012, MAX-SAT) Projects: He is known for developing the UBCSAT framework and the Captain Jack SAT solver. He has also contributed to standards like JBIG2 and JPEG-2000.

Official University Profile

Gaurav RattanView profile

Assistant Professor

University of TwenteNetherlands

Gaurav Rattan is an Assistant Professor in the Department of Applied Mathematics at the University of Twente's Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS), where he joined in May 2024. His research focuses on the mathematical foundations of machine learning on graphs and discrete structures, with particular emphasis on theoretical aspects of graph neural networks. University of Twente, Department of Applied Mathematics (May 2024-present) TU Darmstadt, Postdoctoral Researcher in Pascal Schweitzer's group RWTH Aachen, DFG Eigene Stelle Researcher in Martin Grohe's group Dr. Rattan completed his PhD at IMSc Chennai under V. Arvind and earned his B. Tech. from IIT Bombay, establishing a strong foundation in theoretical computer science and mathematics. His research spans graph theory, algorithms, and machine learning on graphs, with specific expertise in graph isomorphism, graph homomorphisms, and the theoretical underpinnings of graph neural networks. He applies mathematical techniques from logic and algebra to develop theory-driven approaches for graph learning systems, with practical applications in optimization, bioinformatics, and databases. Dr. Rattan's publication record reveals a consistent focus on the intersection of theoretical computer science and machine learning. His recent work explores Weisfeiler-Leman algorithms, symmetry breaking techniques, and parameterized complexity of graph problems, demonstrating how classical graph algorithms connect with modern graph learning methodologies. His research provides crucial theoretical foundations for understanding the capabilities and limitations of graph neural networks. Active in the academic community, Dr. Rattan regularly presents at conferences including the Netherlands Mathematical Congress, SIGAlgo, LOGAMS, and specialized workshops on graph learning. Recent presentations include "From Graph Homomorphisms Densities to Graph Learning" at the Graph Learning Workshop at NITMB Chicago and "Color Refinement: One Algorithm, Many Facets" at SIGAlgo 2024.

Official University Profile

Vijay GaneshView profile

Professor

University of WaterlooCanada

Dr. Vijay Ganesh is a Professor of Computer Science at Georgia Institute of Technology, where he also serves as Associate Director of the IDEaS Institute and is affiliated with Tech AI. Previously, he held roles as Associate Professor (2018–2023) and Assistant Professor (2012–2018) at the University of Waterloo, and Research Scientist at MIT (2007–2012). He earned his PhD from Stanford University in 2007. His research focuses on SAT/SMT solvers and their applications in AI, software engineering, security, mathematics, and physics. Notable contributions include developing solvers like MapleSAT, Z3str4, and AlphaZ3, and exploring machine learning-augmented reasoning. He has led projects in logic for AI, proof complexity, and security of blockchain technologies. His awards include ACM Impact Paper (2019), ACM Test of Time (2016), and DATE’s Ten-Year Most Influential Paper (2008). He has advised startups like Quantstamp, a blockchain security firm, and co-directed the Waterloo AI Institute (2021–2023). His teaching includes courses on discrete mathematics, software engineering, and AI. Education: PhD in Computer Science, Stanford University (2007); Master’s in Electrical Engineering, Stanford (2000) Research Interests: SAT/SMT solvers, formal methods, automated testing, AI security, combinatorial mathematics Affiliations: Georgia Tech’s School of Computer Science, IDEaS Institute

Official University Profile

John FrancoView profile

Professor

University of CincinnatiUnited States

Prof. John Franco is a Professor of Computer Science at the University of Cincinnati, serving as Director of the National Center of Academic Excellence in Cyber Operations. His roles include Editor-in-Chief of the Journal on Satisfiability, Boolean Modeling, and Computation , and Vice Chair of the SAT Association. He has held visiting scientist positions at institutions in Germany (FAW Ulm, Universität Paderborn) and spent sabbatical leave at Fort George G. Meade. Education: Ph.D. in Computer Science, Rutgers University, 1981 M.S. in Electrical Engineering, Columbia University, 1971 B.S. in Electrical Engineering, City College of New York, 1969 Research Interests: Franco’s work focuses on satisfiability (SAT) algorithms, formal verification, cybersecurity, and computational complexity. He has pioneered probabilistic analysis of SAT-solving heuristics and contributed to the integration of SAT techniques into network security and formal methods. His research bridges theoretical computer science with practical applications in cyber defense and algorithm optimization. Grants & Funding: Franco has secured over 18 grants from agencies like the NSA, NSF, and ONR. Notable projects include Satisfiability Algorithm Research (NSA grants since 1999), cybersecurity curriculum development (NSA 2018–2022), and Ohio Cyber Range initiatives. He has led or collaborated on federal and state-funded projects totaling millions in funding. Labs/Teams: Directs the National Center of Academic Excellence in Cyber Operations, a collaborative effort with local defense contractors. His work involves partnerships with institutions like Wright State Applied Research Corporation and Riverside Research Institute.

Official University Profile