Hybrid Algorithms for the Constraint Satisfaction Problem¶
Prosser, P. (1993). Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence, 9(3), 268-299.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Recursive Depth-First Backtracking
- … failure mode is thrashing: plain chronological backtracking rediscovers the same conflict at many different leaves, because it always retreats to the latest choice even when a much earlier choice is the real culprit — the pathology that conflict-directed backjumping and no-good learning were invented to cure.
This sourceProsser contrasts chronological backtracking with conflict-directed backjumping, whose conflict information can return search to an earlier implicated variable rather than merely the immediately preceding choice.
- … failure mode is thrashing: plain chronological backtracking rediscovers the same conflict at many different leaves, because it always retreats to the latest choice even when a much earlier choice is the real culprit — the pathology that conflict-directed backjumping and no-good learning were invented to cure.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:cc80be44d3a5 · see in the full table