Forward Checking
Forward Checking is a constraint propagation algorithm in constraint satisfaction problems that, after assigning a value to a variable, prunes the domains of unassigned variables by removing values that conflict with the assignment, thereby maintaining arc consistency in one direction.
38
Publications
3.5K
Citations
63
Authors
38
Institutions
Publications per year
2017–2026
1
Parents
38
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
Patrick Prosser · Computational Intelligence · 1993 · 519 citations
Solution Reuse in Dynamic Constraint Satisfaction Problems
Thomas Schiex · 1994 · 178 citations
1–5 of 38
63
3
h-index
3
h-index
Centre National de la Recherche Scientifique, France
3 publications · 195 citations
3
h-index
3
h-index
Office National d'Études et de Recherches Aérospatiales, France
2 publications · 186 citations
2
h-index
1–5 of 63
38

Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
200 citations
University of Béjaïa
Béjaïa, Algeria
2 h-index
2 publications
32 citations
Fujitsu (Japan)
Kawasaki, Japan
2 h-index
4 publications
134 citations

University of Strathclyde
Glasgow, United Kingdom
2 h-index
2 publications
564 citations
Université de Lorraine
Nancy, France
2 h-index
3 publications
43 citations
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Montpellier, France
2 h-index
2 publications
180 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
2 publications
74 citations
Université d'Artois
Arras, France
1 h-index
2 publications
20 citations
1–8 of 38
Conference · 4 publications · 106 citations
4
h-index
3 publications · 871 citations
3
h-index
2 publications · 68 citations
2
h-index
Conference · 1 publications · 45 citations
1
h-index
1 publications · 519 citations
1
h-index
1–5