Bart Selman
Impact in
- Computer Networks and Communications top 0.1%
- Constraint Satisfaction and Optimization
- Artificial Intelligence top 0.1%
- Logic, Reasoning, and Knowledge
- AI-based Problem Solving and Planning
- Metaheuristic Optimization Algorithms Research
Papers in
-
- Constraint Satisfaction and Optimization 84
-
- Logic, Reasoning, and Knowledge 25
- AI-based Problem Solving and Planning 23
- Multi-Agent Systems and Negotiation 6
- Artificial Intelligence Applications 6
- Co-authors
- Henry Kautz (47 shared papers)Carla Pedro Gomes (55 shared papers)Hector J. Levesque (8 shared papers)David G. M. Mitchell (3 shared papers)Scott Kirkpatrick (4 shared papers)Jöerg Hoffmann (3 shared papers)Mehul A. Shah (2 shared papers)David McAllester (4 shared papers)
- Journals
- Artificial Intelligence (9 papers)Communications of the ACM (4 papers)Nature (3 papers)Lecture notes in computer science (22 papers)Science (2 papers)
- Partner nations
- United StatesCanadaFrance
In The Last Decade
Bart Selman
168 papers receiving 12.8k citations
Bart Selman's Hit Papers
Peers
Comparison fields: 5 of 142
- Computer Networks and Communications 5.8k
- Artificial Intelligence 5.5k
- Computational Theory and Mathematics 2k
- Statistical and Nonlinear Physics 468
- Software 194
Countries citing papers authored by Bart Selman
This map shows the geographic impact of Bart Selman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bart Selman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bart Selman more than expected).
Fields of papers citing papers by Bart Selman
This network shows the impact of papers produced by Bart Selman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bart Selman. The network helps show where Bart Selman may publish in the future.
Co-authors
The 25 scholars most cited alongside Bart Selman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 173 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | A new method for solving hard satisfiability problems Hit paper breakdown → | 1992 | 938 |
| 2 | Referral Web Hit paper breakdown → | 1997 | 671 |
| 3 | Pushing the envelope: planning, propositional logic, and stochastic search | 1996 | 656 |
| 4 | Planning as satisfiability Hit paper breakdown → | 1992 | 630 |
| 5 | Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI'12) Hit paper breakdown → | 2012 | 616 |
| 6 | Noise strategies for improving local search Hit paper breakdown → | 1994 | 610 |
| 7 | Hard and easy distributions of SAT problems Hit paper breakdown → | 1992 | 608 |
| 8 | Determining computational complexity from characteristic ‘phase transitions’ Hit paper breakdown → | 1999 | 580 |
| 9 | Unstructured human activity detection from RGBD images Hit paper breakdown → | 2012 | 423 |
| 10 | 1994 | 416 | |
| 11 | Boosting combinatorial search through randomization | 1998 | 414 |
| 12 | 1996 | 389 | |
| 13 | 2001 | 337 | |
| 14 | Unifying SAT-based and graph-based planning | 1999 | 322 |
| 15 | Evidence for invariants in local search | 1997 | 286 |
| 16 | 2000 | 272 | |
| 17 | Domain-independent extensions to GSAT: solving large structured satisfiability problems | 1993 | 240 |
| 18 | 1996 | 220 | |
| 19 | Backdoors to typical case complexity | 2003 | 220 |
| 20 | 2004 | 220 |
About Bart Selman
Bart Selman is a scholar working on Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, Management Science and Operations Research and Statistical and Nonlinear Physics, having authored 173 papers that have together received 14.1k indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (84 papers), Logic, Reasoning, and Knowledge (25 papers), AI-based Problem Solving and Planning (23 papers), Advanced Graph Theory Research (9 papers), Machine Learning in Materials Science (8 papers), Multi-Agent Systems and Negotiation (6 papers), Artificial Intelligence Applications (6 papers) and Formal Methods in Verification (6 papers). The work is most often cited by research in Computer Networks and Communications (5.8k citations), Artificial Intelligence (5.5k citations), Computational Theory and Mathematics (2k citations), Statistical and Nonlinear Physics (468 citations) and Software (194 citations). Bart Selman has collaborated with scholars based in United States, Canada and France. Frequent co-authors include Henry Kautz, Carla Pedro Gomes, Hector J. Levesque, David G. M. Mitchell, Scott Kirkpatrick, Jöerg Hoffmann, Mehul A. Shah, David McAllester, Bram Cohen and Ashish Sabharwal. Their work appears in journals such as Artificial Intelligence, Communications of the ACM, Nature, Lecture notes in computer science and Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.