Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,797,741 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Algorithm
Backtracking
Branch (computer science)
Constraint learning
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
Backtracking algorithms for disjunctions of temporal constraints
Kostas Stergiou
,
Manolis Koubarakis
Artificial Intelligence
1998
Corpus ID: 2396997
1997
1997
Local Consistency for Ternary Numeric Constraints
B. Faltings
,
E. Gelle
International Joint Conference on Artificial…
1997
Corpus ID: 7657014
Reference LIA-CONF-1997-007View record in Web of Science Record created on 2006-12-13, modified on 2016-08-08
Review
1996
Review
1996
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem
Ian P. Gent
,
E. MacIntyre
,
P. Prosser
,
Barbara M. Smith
,
T. Walsh
International Conference on Principles and…
1996
Corpus ID: 14075117
The constraint satisfaction community has developed a number of heuristics for variable ordering during backtracking search. For…
Expand
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…
Expand
Highly Cited
1994
Highly Cited
1994
Contradicting Conventional Wisdom in Constraint Satisfaction
Daniel Sabin
,
Eugene C. Freuder
European Conference on Artificial Intelligence
1994
Corpus ID: 5564882
Constraint satisfaction problems have wide application in artificial intelligence. They involve finding values for problem…
Expand
Highly Cited
1994
Highly Cited
1994
Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
J. Crawford
,
A. B. Baker
AAAI Conference on Artificial Intelligence
1994
Corpus ID: 2472027
Considerable progress has been made in recent years in understanding and solving propositional satisfiability problems. Much of…
Expand
Highly Cited
1993
Highly Cited
1993
Nondeterministic Lisp as a Substrate for Constraint Logic Programming
J. Siskind
,
David A. McAllester
AAAI Conference on Artificial Intelligence
1993
Corpus ID: 15508428
We have implemented a comprehensive constraint-based programming language as an extension to COMMON LISP. This constraint package…
Expand
Highly Cited
1993
Highly Cited
1993
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
P. Prosser
International Conference on Climate Informatics
1993
Corpus ID: 36951414
It might be said that there are five basic tree search algorithms for the constraint satisfaction problem (csp), namely, naive…
Expand
1992
1992
Recognition of 3-D objects by forward checking constrained search
Chang J. Cho
,
J. H. Kim
Robotics Auton. Syst.
1992
Corpus ID: 5224831
Highly Cited
1979
Highly Cited
1979
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
R. Haralick
,
G. L. Elliott
Artificial Intelligence
1979
Corpus ID: 1324533
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)
ACCEPT & CONTINUE
or Only Accept Required