PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking

DOI10.1017/S1471068403001893MaRDI QIDQ4669649zbMATH OpenOpenAlexFDO

Authors Maurice Bruynooghe

Publication date 15 April 2005

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1471068403001893

zbMATH Keywords

backjumping

Mathematics Subject Classification ID

Logic programming (68N17) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 5012413
• Efficient intelligent backtracking using linear programming
• Accelerating backtrack search with a best-first-search strategy
• Backtracking search optimization algorithm for numerical optimization problems

Cited in

(9)

• A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems
• scientific article; zbMATH DE number 5012413 (Why is no real title available?)
• A Flexible Search Framework for CHR
• Improving Saddleback Search: A Lesson in Algorithm Design
• A pearl on SAT and SMT solving in Prolog
• An enhancement scheme for constraint satisfaction problems (CSPs)
• Backjumping is Exception Handling
• Implementing backjumping by means of exception handling
• Automatic differentiation in Prolog

This page was built for publication: PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4669649)