Enhancing a Search Algorithm to Perform Intelligent Backtracking

Details Enhancing a Search Algorithm to Perform Intelligent Backtracking Enhancing a Search Algorithm to Perform Intelligent Backtracking

2003-11-05

arxiv.org/abs/cs/0311003v1

Computer Science

Artificial Intelligence

To appear in Theory and Practice of Logic Programming

Scientific paper

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. To appear in Theory and Practice of Logic Programming. Keywords: intelligent backtracking, dependency-directed backtracking, backjumping, conflict-directed backjumping, nogood sets, look-back.

Affiliated with

Also associated with

No associations

Rating

Enhancing a Search Algorithm to Perform Intelligent Backtracking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enhancing a Search Algorithm to Perform Intelligent Backtracking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enhancing a Search Algorithm to Perform Intelligent Backtracking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627952