DMCA
A new algorithm for maintaining arc consistency after constraint retraction (2004)
Cached
Download Links
| Venue: | In Principles and Practice of Constraint Programming |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Surynek04anew,
author = {Pavel Surynek and Roman Barták},
title = {A new algorithm for maintaining arc consistency after constraint retraction},
booktitle = {In Principles and Practice of Constraint Programming},
year = {2004},
pages = {767--771},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Dynamic Constraint Satisfaction Problems play a very important role in modeling and solving real-life problems where the set of constraints is changing. The paper addresses a problem of maintaining arc consistency after removing a constraint from the constraint model. A new dynamic arc consistency algorithm is proposed that improves the practical time efficiency of the existing AC|DC algorithm by using additional data-structures. The algorithm achieves real time efficiency close to the so far fastest DynAC-6 algorithm while keeping the memory consumption low. 1
Keyphrases
arc consistency new algorithm constraint retraction important role constraint model real-life problem practical time efficiency algorithm achieves real time efficiency ac dc algorithm dynamic constraint satisfaction problem additional data-structures memory consumption dynac-6 algorithm new dynamic arc consistency algorithm
