Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

11 relations
AlgorithmBacktrackingBranch (computer science)Constraint learning
Expand

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
There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1999
1999
Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques
This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • table I
1999
1999
Using an Incomplete Version of Dynamic Backtracking for Graph Colouring
  • S. Prestwich
  • Electron. Notes Discret. Math.
  • 1999
    • Corpus ID: 18529682
Abstract This paper investigates a simple, constructive search strategy: an incomplete version of Ginsberg's Dynamic Backtracking… Expand
Highly Cited
1998
Highly Cited
1998
Backtracking algorithms for disjunctions of temporal constraints
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1996
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… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Highly Cited
1996
Highly Cited
1996
Russian Doll Search for Solving Constraint Optimization Problems
If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears that… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
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… Expand
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… Expand
  • figure 2
Highly Cited
1980
Highly Cited
1980
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
Abstract In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems… Expand
  • figure 4
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE