Propagation Algorithms

Propagation Algorithms is a class of constraint-solving methods that systematically reduce the search space by enforcing local consistency conditions through the iterative deduction and elimination of inconsistent values from variable domains.

333

Publications

18.7K

Citations

841

Authors

411

Institutions

Publications per year

2017–2026

70

Authors

841

  1. TW
    Toby Walsh

    Data61, Australia

    10 publications · 256 citations

    10

    h-index

  2. CB
    Christian Bessière

    Centre National de la Recherche Scientifique, France

    7 publications · 320 citations

    7

    h-index

  3. PJ
    Peter J. Stuckey

    The University of Melbourne, Australia

    7 publications · 269 citations

    7

    h-index

  4. CQ
    Claude-Guy Quimper

    Université Laval, Canada

    6 publications · 155 citations

    6

    h-index

  5. LT
    Linda Torczon

    Rice University, United States

    5 publications · 343 citations

    5

    h-index

1–5 of 841

Venues

  1. arXiv (Cornell University)

    Repository · 8 publications · 162 citations

    8

    h-index

  2. Artificial Intelligence

    6 publications · 760 citations

    6

    h-index

  3. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 5 publications · 253 citations

    5

    h-index

  4. Journal of Artificial Intelligence Research

    JAIR · 5 publications · 124 citations

    5

    h-index

  5. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 5 publications · 96 citations

    5

    h-index

1–5