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

Authors

78

  1. PJ
    Peter J. Stuckey

    The University of Melbourne, Australia

    4 publications · 126 citations

    4

    h-index

  2. PC
    Philippe Codognet

    Sorbonne Université, France

    2 publications · 295 citations

    2

    h-index

  3. CH
    Christian Holzbaur

    University of Vienna, Austria

    2 publications · 66 citations

    2

    h-index

  4. DD
    Daniel Díaz

    Université Paris 1 Panthéon-Sorbonne, France

    2 publications · 295 citations

    2

    h-index

  5. NZ
    Neng‐Fa Zhou

    Brooklyn College, United States

    2 publications · 44 citations

    2

    h-index

1–5 of 78

Venues

  1. Science of Computer Programming

    2 publications · 102 citations

    2

    h-index

  2. Theory and Practice of Logic Programming

    2 publications · 80 citations

    2

    h-index

  3. Very Large Data Bases

    Conference · 2 publications · 109 citations

    2

    h-index

  4. ACM SIGPLAN Notices

    1 publications · 14 citations

    1

    h-index

  5. Lirias (KU Leuven)

    Repository · 1 publications · 91 citations

    1

    h-index

1–5