Constraint Satisfaction

Constraint Satisfaction is a computational problem-solving paradigm in artificial intelligence in which a solution is obtained by assigning values to variables so that all specified constraints over those variables are simultaneously satisfied.

7.9K

Publications

441.2K

Citations

11.6K

Authors

2.4K

Institutions

Publications per year

2017–2026

1.1K

Authors

11.6K

  1. TW
    Toby Walsh

    Data61, Australia

    49 publications · 2.5K citations

    28

    h-index

  2. RD
    Rina Dechter

    University of California, Irvine, United States

    41 publications · 6.1K citations

    28

    h-index

  3. PJ
    Peter J. Stuckey

    The University of Melbourne, Australia

    63 publications · 2.4K citations

    27

    h-index

  4. PV
    Pascal Van Hentenryck

    Brown University, United States

    52 publications · 3.3K citations

    25

    h-index

  5. JM
    João Marques‐Silva

    Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento, Portugal

    41 publications · 3.3K citations

    25

    h-index

1–5 of 11.6K

Venues

  1. Artificial Intelligence

    207 publications · 28.9K citations

    83

    h-index

  2. Journal of the ACM

    JACM · 42 publications · 10.3K citations

    38

    h-index

  3. arXiv (Cornell University)

    Repository · 145 publications · 5.4K citations

    38

    h-index

  4. Journal of Artificial Intelligence Research

    JAIR · 99 publications · 6.1K citations

    38

    h-index

  5. European Journal of Operational Research

    83 publications · 5.3K citations

    38

    h-index

1–5