Contradicting Conventional Wisdom in Constraint Satisfaction


Constraint satisfaction problems have wide application in artificial intelligence. They involve finding values for problem variables where the values must be consistent in that they satisfy restrictions on which combinations of values are allowed. Two standard techniques used in solving such problems are backtrack search and consistency inference… (More)
DOI: 10.1007/3-540-58601-6_86



Citations per Year

510 Citations

Semantic Scholar estimates that this publication has 510 citations based on the available data.

See our FAQ for additional information.