Constraint Propagation

286 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

SIGMa: simple greedy matching for aligning large knowledge bases (2012, methodology): “The heuristic of propagating information on a relationship graph is related to a well-known heuristic for solving Constraint Satisfaction Problems known as constraint propagation [2].”
Complete search in continuous global optimization and constraint satisfaction (2004, methodology): “…is called constraint propagation and was pioneered in constraint logic (Cleary 1987, Older and Vellino 1993) and interval analysis (Neumaier 1988), but has also forerunners in presolve techniques in mathematical programming (Mangasarian and McLinden 1985, Lodwick 1989, Anderson and Anderson 1995).”