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.
Highly Cited
2002
Highly Cited
2002
Binary vs. non-binary constraints
Highly Cited
1998
Highly Cited
1998
Backtracking algorithms for disjunctions of temporal constraints
Review
1996
Review
1996
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem
The constraint satisfaction community has developed a number of heuristics for variable ordering during backtracking search. For… 
Highly Cited
1996
Highly Cited
1996
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
  • R. Wallace
  • AAAI/IAAI, Vol. 1
  • 1996
  • Corpus ID: 12225379
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPs. These methods improve… 
Highly Cited
1994
Highly Cited
1994
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
Considerable progress has been made in recent years in understanding and solving propositional satisfiability problems. Much of… 
Highly Cited
1993
Highly Cited
1993
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
It might be said that there are five basic tree search algorithms for the constraint satisfaction problem (csp), namely, naive… 
Highly Cited
1993
Highly Cited
1993
Nondeterministic Lisp as a Substrate for Constraint Logic Programming
We have implemented a comprehensive constraint-based programming language as an extension to COMMON LISP. This constraint package… 
1992
1992
Recognition of 3-D objects by forward checking constrained search
Highly Cited
1985
Highly Cited
1985
Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems
Binary constraint sat is fact ion problems involve f ind ing values for variables subject to constraints between pairs of… 
Highly Cited
1980
Highly Cited
1980
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
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)