2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31860This paper illustrates how a Prolog program, using chronological backtracking to find a solution in some search space, can be enhanced to perform intelligent backtracking. The enhancement crucially relies on the impurity of Prolog that allows a program to store information when a dead end is reached. To illustrate the technique, a simple search program is enhanced. To appear in Theory and Practice of Logic Programming. Keywords: intelligent backtracking, dependency-directed backtracking, backjumping, conflict-directed backjumping, nogood sets, look-back.To appear in Theory and Practice of Logic ProgrammingArtificial IntelligenceLogic in Computer ScienceI.2.8; I.2.3; F.3.3; F.4.1; D.1.6; D3.3text