Enhancing a Search Algorithm to Perform Intelligent Backtracking

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
To appear in Theory and Practice of Logic Programming

Keywords

Artificial Intelligence, Logic in Computer Science, I.2.8; I.2.3; F.3.3; F.4.1; D.1.6; D3.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31860

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0311003
 http://arxiv.org/abs/cs/0311003

Collections

arXiv