DMCA
A Fast Algorithm to Establish Arc-Consistency in Constraint Networks (1994)
| Citations: | 1 - 1 self |
BibTeX
@MISC{Bessière94afast,
author = {Christian Bessière},
title = {A Fast Algorithm to Establish Arc-Consistency in Constraint Networks},
year = {1994}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In [1], Bessière and Cordier said that the AC-6 arc-consistency algorithm is optimal in time on constraint networks where nothing is known about the constraint semantics. However, in constraint networks, it is always assumed that constraints are symmetric. None of the previous algorithms achieving arc-consistency (AC-3, AC-4, AC-6) use this property. We propose here an improved version of AC-6 (the best known algorithm for arc-consistency), which uses this property. 1. Introduction In the last five years, the number of applications using constraint networks has dramatically increased. It appears that more constraint networks are used, more simple are the constraint satisfaction techniques involved in the applications. In fact, a great part of the real-life applications using constraint networks are limited to a forward-checking search procedure, or use an arc-consistency filtering algorithm before or during the search. It is one of the reasons why arc-consistency remains an hot area in...
Keyphrases
constraint network fast algorithm improved version known algorithm forward-checking search procedure constraint semantics ac-6 arc-consistency algorithm hot area constraint satisfaction technique previous algorithm bessi re real-life application arc-consistency filtering algorithm great part
