Csp Search Algorithms

CSP Search Algorithms is a class of systematic exploration methods used in artificial intelligence and constraint programming that distinguish themselves by specifically navigating the search space of Constraint Satisfaction Problems to identify assignments satisfying all imposed constraints.

133

Publications

6.5K

Citations

274

Authors

156

Institutions

Publications per year

2017–2026

5

Variants

Constraint Satisfaction Problem Search Algorithms

Authors

274

  1. TS
    Thomas Schiex

    Centre National de la Recherche Scientifique, France

    5 publications · 356 citations

    5

    h-index

  2. CL
    Christophe Lecoutre

    Centre National de la Recherche Scientifique, France

    4 publications · 501 citations

    4

    h-index

  3. JL
    Javier Larrosa

    Universitat Politècnica de Catalunya, Spain

    4 publications · 316 citations

    4

    h-index

  4. GB
    Gregory B. Sorkin

    IBM Research - Thomas J. Watson Research Center, United States

    3 publications · 74 citations

    3

    h-index

  5. GV
    Gérard Verfaillie

    Office National d'Études et de Recherches Aérospatiales, France

    3 publications · 57 citations

    3

    h-index

1–5 of 274

Venues

  1. National Conference on Artificial Intelligence

    Conference · 6 publications · 330 citations

    6

    h-index

  2. Journal of Artificial Intelligence Research

    JAIR · 5 publications · 211 citations

    5

    h-index

  3. International Joint Conference on Artificial Intelligence

    Conference · 5 publications · 268 citations

    5

    h-index

  4. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 4 publications · 275 citations

    4

    h-index

  5. Constraints

    3 publications · 55 citations

    3

    h-index

1–5