Data structures for generalised arc consistency for extensional constraints

DMCA

Data structures for generalised arc consistency for extensional constraints (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ian P. Gent , Chris Jefferson , Ian Miguel , Peter Nightingale

Venue:	In Proceedings of the Twenty Second Conference on Artificial Intelligence
Citations:	31 - 9 self

BibTeX

@INPROCEEDINGS{Gent07datastructures,
    author = {Ian P. Gent and Chris Jefferson and Ian Miguel and Peter Nightingale},
    title = {Data structures for generalised arc consistency for extensional constraints},
    booktitle = {In Proceedings of the Twenty Second Conference on Artificial Intelligence},
    year = {2007}
}

OpenURL

Abstract

Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagation algorithms for these constraints. We describe the use of two alternative data structures for maintaining generalised arc consistency on extensional constraints. The first, the Next-Difference list, is novel and has been developed with this application in mind. The second, the trie, is well known but its use in this context is novel. Empirical analyses demonstrate the efficiency of the resulting approaches, both in GACschema, and in the watched-literal table constraint in Minion.

Keyphrases

generalised arc consistency extensional constraint data structure alternative data structure constraint programming watched-literal table constraint empirical analysis important tool next-difference list combinatorial problem fast propagation algorithm

DMCA