10 found
Order:
  1.  12
    Hard problems for simple default logics.Henry A. Kautz & Bart Selman - 1991 - Artificial Intelligence 49 (1-3):243-279.
  2.  10
    Model-preference default theories.Bart Selman & Henry A. Kautz - 1990 - Artificial Intelligence 45 (3):287-322.
  3.  10
    Algorithm portfolios.Carla P. Gomes & Bart Selman - 2001 - Artificial Intelligence 126 (1-2):43-62.
  4.  11
    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.  10
    Critical behavior in the computational cost of satisfiability testing.Bart Selman & Scott Kirkpatrick - 1996 - Artificial Intelligence 81 (1-2):273-295.
  8.  10
    The complexity of path-based defeasible inheritance.Bart Selman & Hector J. Levesque - 1993 - Artificial Intelligence 62 (2):303-339.
  9.  17
    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.
  10. DPLL: The Core of Modern Satisfiability Solvers.Bart Selman, Ashish Sabharwal & Donald Loveland - 2016 - In Alberto Policriti & Eugenio Omodeo (eds.), Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Cham, Switzerland: Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark