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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Surynek, P., & Barták, R. (2004). A new algorithm for maintaining arc consistency after constraint retraction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3258, 767–771. https://doi.org/10.1007/978-3-540-30201-8_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
