  We discuss how to implement backjumping (or intelligent backtracking) in
Prolog by using the built-ins throw/1 and catch/3. We show that it is
impossible in a general case, contrary to a claim that ``backjumping is
exception handling". We provide two solutions. One works for binary programs;
in a general case it imposes a restriction on where backjumping may originate.
The other restricts the class of backjump targets. We also discuss implementing
backjumping by using backtracking and the Prolog database. Additionally, we
explain the semantics of Prolog exception handling in the presence of
coroutining.
