Skip to search formSkip to main contentSkip to account menu

Backmarking

In constraint satisfaction, backmarking is a variant of the backtracking algorithm. Backmarking works like backtracking by iteratively evaluating… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
BacktrackingConstraint satisfactionConstraint 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
Constraint satisfaction techniques have been used in Artificial Intelligence planning for many years. As with the original… 
2007
2007
No-good Backmarking : A Repair-Based Algorithm for Constraint Satisfaction and Optimisation
There are three main approaches within the AI community to constraint satisfaction problems (CSP) and constraint optimisation… 
1998
1998
Finding Regions for Local Repair in Partial Constraint Satisfaction
Yet, two classes of algorithms have been used in partial constraint satisfaction: local search methods and branch & bound search… 
1995
1995
Minimal Forward Checking with Backmarking
The idea behind forward checking is to check forward so that a wrong decision can be detected in early stage during search and… 
1995
1995
1 Ng-backmarking-an algorithm for constraint satisfaction
Ng-backmarking with Min-conflict repair, a hybrid algorithm for solving constraint satisfaction problems, is presented in the… 
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)