Constraint Compilation
Constraint Compilation is a method in constraint programming that transforms high-level constraint representations into lower-level, executable forms through inference and reformulation to enhance solving efficiency.
35
Publications
1.4K
Citations
78
Authors
44
Institutions
Publications per year
2017–2026
4
Parents
35
Compiling constraints in clp(FD)
Philippe Codognet, Daniel Díaz · The Journal of Logic Programming · 1996 · 203 citations
1–5 of 35
78
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 78
44

The University of Melbourne
Melbourne, Australia
3 h-index
5 publications
147 citations
University of Vienna
Vienna, Austria
2 h-index
2 publications
66 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
3 publications
452 citations

Monash University
Melbourne, Australia
2 h-index
2 publications
66 citations
Synopsys (United States)
Mountain View, United States
2 h-index
2 publications
49 citations
Motorola (United States)
Schaumburg, United States
2 h-index
2 publications
49 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
49 citations
Ben-Gurion University of the Negev
Beersheba, Israel
2 h-index
4 publications
142 citations
1–8 of 44
2 publications · 102 citations
2
h-index
2 publications · 80 citations
2
h-index
Conference · 2 publications · 109 citations
2
h-index
1 publications · 14 citations
1
h-index
Repository · 1 publications · 91 citations
1
h-index
1–5