Increasing Tree Search Efficiency for Constraint Satisfaction Problems¶
Haralick, R. M., & Elliott, G. L. (1980). Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14(1), 263-313.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Backtracking
- The structure also makes the constraint-propagation-versus-search distinction concrete: forward-checking (eliminating candidates from peer cells the moment a placement is made) is work done between backtracking steps that shrinks the next subtree, complementing rather than replacing the rollback.
This sourceEstablishes forward-checking and constraint propagation as work done between backtracking steps that shrinks the remaining search tree.
- The structure also makes the constraint-propagation-versus-search distinction concrete: forward-checking (eliminating candidates from peer cells the moment a placement is made) is work done between backtracking steps that shrinks the next subtree, complementing rather than replacing the rollback.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:cd94edf42a76 · see in the full table