Csp Solving

CSP Solving is a computational method within constraint programming that systematically determines assignments to variables from finite domains satisfying a set of constraints by applying search, propagation, and inference techniques.

463

Publications

21.2K

Citations

802

Authors

376

Institutions

Publications per year

2017–2026

54

Variants

Constraint Satisfaction Problem Solving

Authors

802

  1. TS
    Thomas Schiex

    Centre National de la Recherche Scientifique, France

    15 publications · 1.1K citations

    12

    h-index

  2. JL
    Javier Larrosa

    Universitat Politècnica de Catalunya, Spain

    11 publications · 708 citations

    10

    h-index

  3. AK
    Andrei Krokhin

    Durham University, United Kingdom

    7 publications · 242 citations

    7

    h-index

  4. GV
    Gérard Verfaillie

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

    7 publications · 507 citations

    7

    h-index

  5. CB
    Christian Bessière

    Centre National de la Recherche Scientifique, France

    6 publications · 337 citations

    6

    h-index

1–5 of 802

Venues

  1. Constraints

    12 publications · 673 citations

    11

    h-index

  2. National Conference on Artificial Intelligence

    Conference · 10 publications · 1.2K citations

    10

    h-index

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

    Repository · 9 publications · 440 citations

    9

    h-index

  4. Artificial Intelligence

    8 publications · 846 citations

    8

    h-index

  5. arXiv (Cornell University)

    Repository · 8 publications · 182 citations

    8

    h-index

1–5