H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 64 Citations 27,491 167 World Ranking 1190 National Ranking 695

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • Artificial intelligence
  • Algorithm
  • Programming language

Bart Selman mainly investigates Satisfiability, Algorithm, Theoretical computer science, WalkSAT and Artificial intelligence. His studies deal with areas such as Computational complexity theory and Management science as well as Satisfiability. The Algorithm study combines topics in areas such as Domain, Initialization, Scheduling and Benchmark.

His Theoretical computer science research is multidisciplinary, incorporating perspectives in Inference, Computational problem, Graphplan and Knowledge representation and reasoning. The various areas that Bart Selman examines in his Artificial intelligence study include Machine learning, Maximum-entropy Markov model and Computer vision. His Local search research includes themes of Simulated annealing and Local search.

His most cited work include:

  • A new method for solving hard satisfiability problems (1204 citations)
  • Referral Web: combining social networks and collaborative filtering (946 citations)
  • Pushing the envelope: planning, propositional logic, and stochastic search (826 citations)

What are the main themes of his work throughout his whole career to date?

His main research concerns Algorithm, Theoretical computer science, Artificial intelligence, Mathematical optimization and Satisfiability. Many of his research projects under Algorithm are closely connected to WalkSAT with WalkSAT, tying the diverse disciplines of science together. His work carried out in the field of Theoretical computer science brings together such families of science as Combinatorial search, Message passing, Inference, Satplan and Solver.

His Artificial intelligence research is multidisciplinary, relying on both Machine learning, Task and Computer vision. His study explores the link between Mathematical optimization and topics such as Constraint satisfaction problem that cross with problems in Computational problem and Search algorithm. His Satisfiability research incorporates elements of Domain, Distribution and Local search.

He most often published in these fields:

  • Algorithm (25.00%)
  • Theoretical computer science (23.53%)
  • Artificial intelligence (23.16%)

What were the highlights of his more recent work (between 2011-2021)?

  • Artificial intelligence (23.16%)
  • Algorithm (25.00%)
  • Mathematical optimization (18.75%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Artificial intelligence, Algorithm, Mathematical optimization, Sequence and Theoretical computer science. His studies link Machine learning with Artificial intelligence. The Decoding methods research Bart Selman does as part of his general Algorithm study is frequently linked to other disciplines of science, such as Exponential growth, therefore creating a link between diverse domains of science.

Bart Selman has researched Mathematical optimization in several fields, including Computation and Set. The study incorporates disciplines such as Combinatorial search and Combinatorial optimization in addition to Theoretical computer science. Bart Selman has included themes like Programming language and Satisfiability in his Range study.

Between 2011 and 2021, his most popular works were:

  • Unstructured human activity detection from RGBD images (401 citations)
  • Understanding Batch Normalization (164 citations)
  • Low-density Parity Constraints for Hashing-Based Discrete Integration (58 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Algorithm
  • Programming language

His primary areas of study are Artificial intelligence, Algorithm, Exponential growth, Theoretical computer science and Hash function. His studies in Artificial intelligence integrate themes in fields like Machine learning and Set. His Algorithm research integrates issues from Initialization, Deep learning and Maxima and minima.

His Theoretical computer science study combines topics in areas such as Inference, Scalability and Combinatorial optimization. Bart Selman studied Hash function and Graphical model that intersect with Computation, Curse of dimensionality, Randomized algorithm and Model selection. His Mathematical optimization study focuses on Simulated annealing in particular.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Generating hard satisfiability problems

Bart Selman;David G. Mitchell;Hector J. Levesque.
Artificial Intelligence (1996)

2287 Citations

A new method for solving hard satisfiability problems

Bart Selman;Hector Levesque;David Mitchell.
national conference on artificial intelligence (1992)

1970 Citations

Referral Web: combining social networks and collaborative filtering

Henry Kautz;Bart Selman;Mehul Shah.
Communications of The ACM (1997)

1502 Citations

Planning as satisfiability

Henry Kautz;Bart Selman.
european conference on artificial intelligence (1992)

1406 Citations

Hard and easy distributions of SAT problems

David Mitchell;Bart Selman;Hector Levesque.
national conference on artificial intelligence (1992)

1325 Citations

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

Henry Kautz;Bart Selman.
national conference on artificial intelligence (1996)

1281 Citations

Noise strategies for improving local search

Bart Selman;Henry A. Kautz;Brain Cohen.
national conference on artificial intelligence (1994)

1254 Citations

Determining computational complexity from characteristic 'phase transitions.'

Rémi Monasson;Riccardo Zecchina;Scott Kirkpatrick;Bart Selman.
Nature (1999)

935 Citations

Local search strategies for satisfiability testing

Bart Selman;Henry A. Kautz;Bram Cohen.
Cliques, Coloring, and Satisfiability : 2nd DIMACS Implementation Challenge (1993)

927 Citations

Boosting combinatorial search through randomization

Carla P. Gomes;Bart Selman;Henry Kautz.
national conference on artificial intelligence (1998)

857 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Bart Selman

Toby Walsh

Toby Walsh

Commonwealth Scientific and Industrial Research Organisation

Publications: 72

Holger H. Hoos

Holger H. Hoos

Leiden University

Publications: 72

Joao Marques-Silva

Joao Marques-Silva

Centre national de la recherche scientifique, CNRS

Publications: 64

Thomas Eiter

Thomas Eiter

TU Wien

Publications: 57

Stefan Szeider

Stefan Szeider

TU Wien

Publications: 45

Tim Menzies

Tim Menzies

North Carolina State University

Publications: 43

Carla P. Gomes

Carla P. Gomes

Cornell University

Publications: 42

Rina Dechter

Rina Dechter

University of California, Irvine

Publications: 39

Kevin Leyton-Brown

Kevin Leyton-Brown

University of British Columbia

Publications: 39

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 38

Mitsuru Ishizuka

Mitsuru Ishizuka

University of Tokyo

Publications: 38

Hector Geffner

Hector Geffner

Pompeu Fabra University

Publications: 38

Subbarao Kambhampati

Subbarao Kambhampati

Arizona State University

Publications: 38

Miroslaw Truszczynski

Miroslaw Truszczynski

University of Kentucky

Publications: 36

Ian P. Gent

Ian P. Gent

University of St Andrews

Publications: 34

Something went wrong. Please try again later.