Enhancing a Search Algorithm to Perform Intelligent Backtracking
人工智能
2007-05-23 v1 计算机科学中的逻辑
摘要
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.
引用
@article{arxiv.cs/0311003,
title = {Enhancing a Search Algorithm to Perform Intelligent Backtracking},
author = {Maurice Bruynooghe},
journal= {arXiv preprint arXiv:cs/0311003},
year = {2007}
}
备注
To appear in Theory and Practice of Logic Programming