Understanding and Improving the MAC Algorithm

  title={Understanding and Improving the MAC Algorithm},
  author={Daniel Sabin and Eugene C. Freuder},
Constraint satisfaction problems have wide application in artiicial intelligence. They involve nding values for problem variables where the values must be consistent in that they satisfy restrictions on which combinations of values are allowed. Recent research on nite domain constraint satisfaction problems suggest that Maintaining Arc Consistency (MAC) is the most eecient general CSP algorithm for solving large and hard problems. In the rst part of this paper we explain why maintaining full… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-10 of 66 extracted citations

Backtracking Search Algorithms

Handbook of Constraint Programming • 2006
View 15 Excerpts
Highly Influenced

On the Variable Ordering in Subgraph Isomorphism Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics • 2017
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 12 references

Network-Based Heuristics for Constraint-Satisfaction Problems

Artif. Intell. • 1987
View 9 Excerpts
Highly Influenced

Developpement d'outils algorithmiques pour l'Intelligence Arti cielle. Application a la chimie organique

Regin, J.-C
Ph.D. Dissertation, • 1995

Foundations of constraint satisfaction

Computation in cognitive science • 1993

Tree search and arc-consistency in constraint satisfaction algo rithms

B. Nadel
Search in Arti cial Intelligence • 1988
View 2 Excerpts

Similar Papers

Loading similar papers…