In some search problems, there is no sequential dependence among choices; it can be inefficient to use chronological backtracking.
Dependency-directed backtracking keeps track of the assumptions on which facts in the database depend. If a contradiction is found, backjumping to the choices on which the contradiction depends can make the search more efficient.
Some truth maintenance system implementations are related to dependency-directed backtracking.