The Tractability of Global Constraints

DMCA

The Tractability of Global Constraints (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Christian Bessiere , Emmanuel Hebrard , Brahim Hnich , Toby Walsh

Venue:	IN PROCEEDINGS CP’04
Citations:	14 - 4 self

BibTeX

@INPROCEEDINGS{Bessiere04thetractability,
    author = {Christian Bessiere and Emmanuel Hebrard and Brahim Hnich and Toby Walsh},
    title = {The Tractability of Global Constraints},
    booktitle = {IN PROCEEDINGS CP’04},
    year = {2004},
    pages = {716--720},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or during backtracking search. Propagating global constraints is intractable in general. In this paper, we characterize a number of important questions related to constraint propagation. For example, we consider the two questions: "Is this problem generalized arc-consistent?" and "What are the maximal generalized arc-consistent domains?". We identify dependencies between the tractability and intractability of these questions for finite domain variables. Finally,

Keyphrases

global constraint search space fast algorithm important question maximal generalized arc-consistent domain constraint programming backtracking search finite domain variable constraint propagation

DMCA