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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
Highly Cited
1998
Review
1996
Review
1996
The constraint satisfaction community has developed a number of heuristics for variable ordering during backtracking search. For… 
Highly Cited
1996
Highly Cited
1996
  • 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
Considerable progress has been made in recent years in understanding and solving propositional satisfiability problems. Much of… 
Highly Cited
1993
Highly Cited
1993
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
We have implemented a comprehensive constraint-based programming language as an extension to COMMON LISP. This constraint package… 
Highly Cited
1985
Highly Cited
1985
Binary constraint sat is fact ion problems involve f ind ing values for variables subject to constraints between pairs of… 
Highly Cited
1980