Hostname: page-component-848d4c4894-pjpqr Total loading time: 0 Render date: 2024-06-29T04:54:38.302Z Has data issue: false hasContentIssue false
  • English
  • Français

PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking

Published online by Cambridge University Press:  16 April 2004

MAURICE BRUYNOOGHE
MAURICE BRUYNOOGHE
Affiliation:
Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B3001 Heverlee, Belgium (e-mail: Maurice.Bruynooghe@cs.kuleuven.ac.be)
Get access Rights & Permissions [Opens in a new window]

Abstract

This 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.

Keywords

intelligent backtrackingdependency-directed backtrackingbackjumpingconflict-directed backjumpingnogood setslook-back
Type
Research Article
Information
Theory and Practice of Logic Programming , Volume 4 , Issue 3 , May 2004 , pp. 371 - 380
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)