Order:
  1.  10
    Hard problems for simple default logics.Henry A. Kautz & Bart Selman - 1991 - Artificial Intelligence 49 (1-3):243-279.
  2.  8
    Model-preference default theories.Bart Selman & Henry A. Kautz - 1990 - Artificial Intelligence 45 (3):287-322.
  3.  9
    Algorithm portfolios.Carla P. Gomes & Bart Selman - 2001 - Artificial Intelligence 126 (1-2):43-62.
  4.  10
    Generating hard satisfiability problems.Bart Selman, David G. Mitchell & Hector J. Levesque - 1996 - Artificial Intelligence 81 (1-2):17-29.
  5.  7
    Horn approximations of empirical data.Henry Kautz, Michael Kearns & Bart Selman - 1995 - Artificial Intelligence 74 (1):129-145.
  6.  7
    Support set selection for a bductive and default reasoning.Bart Selman & Hector J. Levesque - 1996 - Artificial Intelligence 82 (1-2):259-272.
  7.  9
    Critical behavior in the computational cost of satisfiability testing.Bart Selman & Scott Kirkpatrick - 1996 - Artificial Intelligence 81 (1-2):273-295.
  8.  8
    The complexity of path-based defeasible inheritance.Bart Selman & Hector J. Levesque - 1993 - Artificial Intelligence 62 (2):303-339.
  9.  15
    Sensor networks and distributed CSP: communication, computation and complexity.Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla Gomes, Bhaskar Krishnamachari, Bart Selman & Magda Valls - 2005 - Artificial Intelligence 161 (1-2):117-147.