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
Variants
Constraint Satisfaction ProblemCsp
Parents
7.9K
1–5 of 7.9K
11.6K
28
h-index
28
h-index
27
h-index
25
h-index
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
2.4K

Centre National de la Recherche Scientifique
Paris, France
58 h-index
539 publications
31.2K citations
Carnegie Mellon University
Pittsburgh, United States
50 h-index
248 publications
22.3K citations
Stanford University
Stanford, United States
48 h-index
170 publications
13.9K citations
Massachusetts Institute of Technology
Cambridge, United States
44 h-index
210 publications
18.4K citations
University of California, Berkeley
Berkeley, United States
42 h-index
192 publications
15.6K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
40 h-index
164 publications
7.7K citations

Cornell University
Ithaca, United States
37 h-index
124 publications
8.1K citations
University of Oxford
Oxford, United Kingdom
36 h-index
124 publications
6.1K citations
1–8 of 2.4K
207 publications · 28.9K citations
83
h-index
JACM · 42 publications · 10.3K citations
38
h-index
Repository · 145 publications · 5.4K citations
38
h-index
JAIR · 99 publications · 6.1K citations
38
h-index
83 publications · 5.3K citations
38
h-index
1–5