Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,935,582 papers from all fields of science
Search
Sign In
Create Free Account
Backmarking
In constraint satisfaction, backmarking is a variant of the backtracking algorithm. Backmarking works like backtracking by iteratively evaluating…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Backtracking
Constraint satisfaction
Constraint satisfaction problem
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Heuristically guided constraint satisfaction for AI planning
Mark Judge
2015
Corpus ID: 17229575
Constraint satisfaction techniques have been used in Artificial Intelligence planning for many years. As with the original…
Expand
1998
1998
Finding Regions for Local Repair in Partial Constraint Satisfaction
Harald Meyer auf'm Hofe
Deutsche Jahrestagung für Künstliche Intelligenz
1998
Corpus ID: 15885073
Yet, two classes of algorithms have been used in partial constraint satisfaction: local search methods and branch & bound search…
Expand
1995
1995
Minimal Forward Checking with Backmarking
A. Kwan
,
E. Tsang
1995
Corpus ID: 17148364
The idea behind forward checking is to check forward so that a wrong decision can be detected in early stage during search and…
Expand