Backtracking

Known as: Backtracking search, Backtracking algorithm, Backtrack 
Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Analyzing intrusions today is an arduous, largely manual task because system administrators lack the information and tools needed… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We propose a framework for solving CSPs based both on backtracking techniques and on the notion of tree-decomposition of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The adaptation of software technology to distributed environments will be an important challenge in the next few years. In the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In recent years, many new backtracking algorithms for solving constraint satisfaction problems have been proposed. The algorithms… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The goal of this project was to turn the intuitions behind dynamic backtracking into a series of formally veri ed algorithms… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Programmers spend considerable time debugging code. Symbolic debuggers provide some help but the task remains complex and di cult… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
system for handling the design of elevator systems that is currently in use at Westinghouse Elevator Company Although VT tries to… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 12
  • figure 16
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A constraint satisfaction problem revolves finding values for a set of variables subject to a set of constraints (relations) on… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1977
Highly Cited
1977
We present a rule-based system for computer-aided circuit analysis. The set of rules, called EL, is written in a rule language… (More)
Is this relevant?