Refining the basic constraint propagation algorithm

DMCA

Refining the basic constraint propagation algorithm (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Christian Bessière

Venue:	In Proceedings IJCAI’01
Citations:	100 - 12 self

BibTeX

@INPROCEEDINGS{Bessière01refiningthe,
    author = {Christian Bessière},
    title = {Refining the basic constraint propagation algorithm},
    booktitle = {In Proceedings IJCAI’01},
    year = {2001},
    pages = {309--315}
}

OpenURL

Abstract

Propagating constraints is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the use of the best algorithms. But the ease of integration is also one of the concerns when implementing an algorithm in a constraint solver. This paper focuses on AC-3, which is the simplest arc consistency algorithm known so far. We propose two refinements that preserve as much as possible the ease of integration into a solver (no heavy data structure to be maintained during search), while giving some noticeable improvements in efficiency. One of the proposed refinements is analytically compared to AC-6, showing interesting properties, such as optimality of its worst-case time complexity. 1

Keyphrases

basic constraint propagation algorithm constraint solver constraint propagation main feature noticeable improvement arc consistency algorithm prime importance heavy data structure interesting property worst-case time complexity

DMCA