Enhancing a search algorithm to perform intelligent backtracking

Authors:
Maurice Bruynooghe
Affiliations:
Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B3001 Heverlee, Belgium (e-mail: Maurice.Bruynooghe@cs.kuleuven.ac.be)
Venue:
Theory and Practice of Logic Programming
Year:
2004

Citing 3
Cited 6

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Backjump-based backtracking for constraint satisfaction problems

Artificial Intelligence
Detecting Unsolvable Queries for Definite Logic Programs

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming

Intelligent search strategies based on adaptive Constraint Handling Rules

Theory and Practice of Logic Programming
Modified branch and bound algorithm

EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
Synthesising robust schedules for minimum disruption repair using linear programming

Acta Cybernetica
A Flexible Search Framework for CHR

Constraint Handling Rules
A pearl on SAT solving in prolog

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A pearl on SAT and SMT solving in Prolog

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.