Skip to search formSkip to main contentSkip to account menu

Look-ahead (backtracking)

Known as: Backtracking look-ahead, Forward checking 
In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variable… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
AlgorithmBacktrackingBranch (computer science)Constraint learning

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Algebraic Structures for Bipolar Constraint-Based Reasoning
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of… 
2001
2001
Distributed Forward Checking with Dynamic Ordering
2001
2001
Interactive Modeling for Batch Simulation of Engineering Systems: A Constraint Satisfaction Problem
We have presented here an algorithm CPRAO for doing constraint processing using relational algebraic operators. Van Beek and… 
1999
1999
Using an Incomplete Version of Dynamic Backtracking for Graph Colouring
  • S. Prestwich
  • Electron. Notes Discret. Math.
  • 1999
  • Corpus ID: 18529682
1999
1999
Extending CLP(FD) with Interactive Data Acquisition for 3D Visual Object Recognition
This paper addresses the 3D object recognition problem modelled as a Constraint Satisfaction Problem. In this setting, each… 
1997
1997
Local Consistency for Ternary Numeric Constraints
Reference LIA-CONF-1997-007View record in Web of Science Record created on 2006-12-13, modified on 2016-08-08 
1996
1996
Nogood Learning for Constraint Satisfaction
The basic algorithm is derived from the weak-commitment algorithm (WC) of Yokoo [17], which has been shown to outperform breakout… 
1994
1994
Maximal Sets of Solutions for Constraint Satisfaction Problems
Real constrained problems often demand specific answers to meet requirements like bounded computation time, user preferences or… 
1992
1992
Recognition of 3-D objects by forward checking constrained search
1982
1982
Consistent-Labeling Problems and Their Algorithms
Two new classes of theories have been developed giving the expected complexities of three Consistent-Labeling Problem (CLP), or… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)