Enhancing a Search Algorithm to Perform Intelligent Backtracking

Simple item page
dc.creatorBruynooghe, Maurice
dc.date2003-11-05
dc.date.accessioned2026-07-07T03:20:32Z
dc.date.available2026-07-07T03:20:32Z
dc.descriptionThis 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.
dc.descriptionTo appear in Theory and Practice of Logic Programming
dc.identifierhttps://arxiv.org/abs/cs/0311003
dc.identifierhttp://arxiv.org/abs/cs/0311003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31860
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectI.2.8; I.2.3; F.3.3; F.4.1; D.1.6; D3.3
dc.titleEnhancing a Search Algorithm to Perform Intelligent Backtracking
dc.typetext

Files

Collections

arXiv