Enhancing a Search Algorithm to Perform Intelligent Backtracking
Maurice Bruynooghe
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. To appear in Theory and Practice of Logic Programming. Keywords: intelligent backtracking, dependency-directed backtracking, backjumping, conflict-directed backjumping, nogood sets, look-back.
Create a lesson
Related papers
BEAKER: An Expert-Curated Benchmark for Embodied Brains in Self-Driving Chemical Laboratories
Fei Lin, Tengchao Zhang, Ziyang Gong et al.
FrontierPhysics: Evaluating Agents for End-to-End Physics Research
Bingran You, Wenjun Ke, Ria Rosenauer et al.
Dull, Dirty, Dangerous? Working Conditions and the Limits of Occupational AI Exposure
Siyi Yu
Learning to Decode Linear Codes with Generalized Belief Propagation Network
Samira Malek
On Turn-Level Best-of-N Sampling for Scaling LLM Agents
Jalaj Bhandari, Dhawal Gupta, Hongli Zhan et al.
CompressionBench: How can your coding agents compress LLMs?
Xinrui Zhong, Zhifeng Li, Zhiming Wang et al.