Backmarking

In constraint satisfaction, backmarking is a variant of the backtracking algorithm. Backmarking works like backtracking by iteratively evaluating…

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…

2007

There are three main approaches within the AI community to constraint satisfaction problems (CSP) and constraint optimisation…

1998

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

1997

1996

Dent and Mercer (1996) have introduced an algorithm called minimal forward checking (MFC) which always performs no worse than…

1995

Ng-backmarking with min-conflict repair, a «complete» hybrid algorithm for solving constraint and optimisation problems, is…

1995

The idea behind forward checking is to check forward so that a wrong decision can be detected in early stage during search and…

1995

Ng-backmarking with Min-conflict repair, a hybrid algorithm for solving constraint satisfaction problems, is presented in the…

1993

Constraint satisfaction has received great attention in recent years and a large number of algorithms have been developed…

1993

The backmarking routine (BM) attempts to minimize the execution of redundant consistency checks within the constraint…