2026 Bart Selman: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	77	1239	1198	656	630	263	33880

Research.com Recognitions

2012 - ACM Fellow For contributions to artificial intelligence with applications to automated reasoning and planning.
2002 - Fellow of the American Association for the Advancement of Science (AAAS)
2000 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to the field of knowledge representation and reasoning, and the development of widely used randomized methods in reasoning, search, and planning.
1999 - Fellow of Alfred P. Sloan Foundation

Overview

Bart Selman is affiliated with Cornell University in the United States. Their research primarily focuses on the field of Computer Science, with particular attention to Artificial Intelligence, Statistical and Nonlinear Physics, Computational Theory and Mathematics, Computer Networks and Communications, and Software.

The main topics within their work include AI-based Problem Solving and Planning, Software Engineering Research, Bayesian Modeling and Causal Inference, Machine Learning and Algorithms, Constraint Satisfaction and Optimization, Model-Driven Software Engineering Techniques, and Scheduling and Optimization Algorithms.

Selman has frequently collaborated with a number of co-authors. Notable collaborators include Carla P. Gomes, Niko A. Grupen, Daniel D. Lee, Dieqiao Feng, and Henry Kautz.

They have published extensively, with a noticeable presence in venues such as arXiv (Cornell University) and the Proceedings of the AAAI Conference on Artificial Intelligence. Other publication venues include IEEE Transactions on Circuits and Systems I Regular Papers, Dagstuhl Research Online Publication Server, and AI Magazine.

Recent publications include:

"Cooperative Multi-Agent Fairness and Equivariant Policies" (2022) at Proceedings of the AAAI Conference on Artificial Intelligence
"From Streamlined Combinatorial Search to Efficient Constructive Procedures" (2021) at Proceedings of the AAAI Conference on Artificial Intelligence
"Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning" (2020) at arXiv (Cornell University)
"A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances" (2021) at arXiv (Cornell University)
"Automating Crystal-Structure Phase Mapping: Combining Deep Learning with Constraint Reasoning" (2021) at arXiv (Cornell University)

Bart Selman has received several awards and honors, which include:

ACM Fellow (2012) for contributions to artificial intelligence with applications to automated reasoning and planning
Fellow of the American Association for the Advancement of Science (AAAS) (2002)
Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) (2000), recognized for significant contributions to knowledge representation and reasoning and for the development of widely used randomized methods in reasoning, search, and planning
Fellow of Alfred P. Sloan Foundation (1999)

Best Publications

Generating hard satisfiability problems

Bart Selman;David G. Mitchell;Hector J. Levesque

2369
Citations
A new method for solving hard satisfiability problems

Bart Selman;Hector Levesque;David Mitchell

1971
Citations
Referral Web: combining social networks and collaborative filtering

Henry Kautz;Bart Selman;Mehul Shah

1543
Citations
Planning as satisfiability

Henry Kautz;Bart Selman

1506
Citations
Hard and easy distributions of SAT problems

David Mitchell;Bart Selman;Hector Levesque

1365
Citations
Pushing the envelope: planning, propositional logic, and stochastic search

Henry Kautz;Bart Selman

1316
Citations
Noise strategies for improving local search

Bart Selman;Henry A. Kautz;Brain Cohen

1284
Citations
Determining computational complexity from characteristic 'phase transitions.'

Rémi Monasson;Riccardo Zecchina;Scott Kirkpatrick;Bart Selman

1024
Citations
Local search strategies for satisfiability testing

Bart Selman;Henry A. Kautz;Bram Cohen

957
Citations
Boosting combinatorial search through randomization

Carla P. Gomes;Bart Selman;Henry Kautz

891
Citations
Critical Behavior in the Satisfiability of Random Boolean Expressions

Scott Kirkpatrick;Bart Selman

796
Citations
Unifying SAT-based and graph-based planning

Henry Kautz;Bart Selman

714
Citations
Unstructured human activity detection from RGBD images

Jaeyong Sung;Colin Ponce;Bart Selman;Ashutosh Saxena

692
Citations
Local Search Strategies for Satisfiability Testing

Bart Selman;Bram Cohen;Henry Kautz

629
Citations
Algorithm portfolios

Carla P. Gomes;Bart Selman

572
Citations
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Carla P. Gomes;Bart Selman;Nuno Crato;Henry Kautz

561
Citations
Evidence for invariants in local search

David McAllester;Bart Selman;Henry Kautz

551
Citations
The Hidden Web

Henry A. Kautz;Bart Selman;Mehul A. Shah

504
Citations
Domain-independent extensions to GSAT: solving large structured satisfiability problems

Bart Selman;Henry Kautz

501
Citations
Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI'12)

Joerg Hoffmann;Bart Selman

242
Citations
Understanding Batch Normalization

Johan Bjorck;Carla Gomes;Bart Selman;Kilian Q. Weinberger

16
Citations

Frequent Co-Authors

Carla P. Gomes Cornell University

Henry Kautz University of Virginia

Stefano Ermon Stanford University

Ashish Sabharwal Allen Institute for Artificial Intelligence

Eric Horvitz Microsoft (United States)

Hector J. Levesque University of Toronto

Ashutosh Saxena Cornell University

Jörg Hoffmann Saarland University

David McAllester Toyota Technological Institute at Chicago

John M. Gregoire California Institute of Technology

External Links

Wikipedia of Bart Selman Personal website of Bart Selman Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees is an excellent way to launch or advance your computer science career from anywhere. Many students start with an associate degree online, which can be completed in as little as six months and covers essential foundational skills. This flexible option is ideal for those eager to enter the workforce quickly or for anyone planning to continue toward a bachelor’s program.

Cost is a key concern for many learners. Seeking out the online business degree cost comparisons—as well as similar research in computer science—can help you identify programs that fit your budget. For those prioritizing affordability, researching the cheapest online college bachelor degree options ensures you receive a quality education without overwhelming debt.

If your interests lie in applied technology, pursuing an online engineer degree can open doors to lucrative industries like robotics, software design, and data analytics. Online learning offers the flexibility and accessibility you need to build a successful tech career—on your own terms.