Arc-Consistency in Constraint Satisfaction Problems: A Survey

Arc consistency (AC) is very important in Constraint Satisfaction Problems (CSPs). Several algorithms have been made to deal with arc consistency, the most known is the Maintaining arc consistency algorithm (MAC). The usefulness of AC processing was recognized early. As a result, many AC algorithms...

Full description

Saved in:
Bibliographic Details
Published in2010 Second International Conference on Computational Intelligence, Modelling and Simulation pp. 291 - 296
Main Authors Dib, M, Abdallah, R, Caminada, A
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2010
Subjects
Arc Consistency
Color
Complexity theory
Computational modeling
constraints propagation
Constraints Satisfaction Problem (CSP)
Data structures
Filtering algorithms
Heuristic algorithms
Search algorithm
Time frequency analysis
Online AccessGet full text

Cover

More Information
Summary:Arc consistency (AC) is very important in Constraint Satisfaction Problems (CSPs). Several algorithms have been made to deal with arc consistency, the most known is the Maintaining arc consistency algorithm (MAC). The usefulness of AC processing was recognized early. As a result, many AC algorithms for binary constraints have been proposed in the literature. In this paper we will clearly present the most famous ones (AC-1, AC-2, AC-3, AC-4, AC-5, AC-6, AC-7, AC-2000, AC-2001, AC-inference). A comparative analysis is presented to figure out which one is the best to use.
ISBN:1424486521
9781424486526
ISSN:2166-8523
2166-8531
DOI:10.1109/CIMSiM.2010.18