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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Constraint satisfaction techniques have been used in Artificial Intelligence planning for many years. As with the original…

2015

The Cognitively Enhanced Complex Event Processing (CECEP) architecture is an autonomous decision support tool that reasons and…

2005

In response to the call for solvers by the CPAI’05 solver competition organizing committee, we implemented a constraint solver…

2002

Many application problems can be formulated as dynamic preference constraint satisfaction problems. Such a problem employs…

2001

We investigate how the performance of search for solving finite constraint satisfaction problems (CSPs) is affected by the level…

1999

Several content-based queries in spatial databases and geographic infonnation systems (GISs) can be modelled and processed as…

1998

Yet, two classes of algorithms have been used in partial constraint satisfaction: local search methods and branch & bound search…

1994

It has been observed by several authors that for many NP problems, a sharp peak in the median cost to nd a solution can be seen…

1992

model ' & $% Detailed model of the heart -'& $% Relational table -' & $% Compressed diagnostic rules E E E E E E E E E Figure 1…

1988